- How to Make a Multiprocessor Computer That Correctly Executes Multiprocess Programs L. Lamport Wed 30 January 2013
- BI as an assertion language for mutable data structures Samin S. Ishtiaq Peter W. O'Hearn Wed 30 January 2013
- Undecidability of Propositional Separation Logic and Its Neighbours James Brotherston Max Kanovich Wed 30 January 2013
- A decidable fragment of separation logic Josh Berdine Cristiano Calcagno Peter W. O'Hearn Wed 30 January 2013
- How to make ad-hoc polymorphism less ad hoc P. Wadler S. Blott Wed 30 January 2013
- Formal verification of a realistic compiler Xavier Leroy Wed 30 January 2013
- How to make ad hoc proof automation less ad hoc Georges Gonthier Beta Ziliani Aleksandar Nanevski Derek Dreyer Wed 30 January 2013
- A note on model checking the modal nu-calculus Glynn Winskel Wed 30 January 2013
- A Note on Model Checking the Modal nu-Calculus Glynn Winskel Wed 30 January 2013
- Local model checking in the modal mu-calculus Colin Stirling David Walker Wed 30 January 2013
- Parametric corecursion Lawrence S. Moss Wed 30 January 2013
- Proof System for Hennessy-Milner Logic with Recursion Kim Guldstrand Larsen Wed 30 January 2013
- Results on the propositional mu-calculus Dexter Kozen Wed 30 January 2013
- Specification and Design of (Parallel) Programs Cliff B. Jones Wed 30 January 2013
- A compositional proof system for the modal mu;-calculus H.R. Andersen C. Stirling G. Winskel Wed 30 January 2013
- Bisimilarity as a Theory of Functional Programming Andrew D. Gordon Wed 30 January 2013
- Notions of computation and monads Eugenio Moggi Wed 30 January 2013
- Boolean satisfiability from theoretical hardness to practical success Sharad Malik Lintao Zhang Wed 30 January 2013
- Satisfiability Solvers Are Static Analysers Vijay D'Silva Leopold Haller Daniel Kroening Wed 30 January 2013
- Refining Model Checking by Abstract Interpretation Patrick Cousot Radhia Cousot Wed 30 January 2013
Library Size: 13G (12979 entries),
Last Updated: Apr 21, 2026, 15:38:46,
Build Time: N/A
