200 search results - page 30 / 40 » Invariant Logics |
CSL
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. Girard’s Geometry of Interaction (GoI) develops a mathematical framework for modelling the dynamics of cut-elimination. We introduce a typed version of GoI, called Mult...
POPL
1993
ACM
13 years 11 months ago
1993
ACM
e data structures are abstractions of simple records and pointers. They impose a shape invariant, which is verified at compiletime and exploited to automatically generate code fo...
JLP
2007
13 years 7 months ago
2007
Several induction theorem provers were developed to verify functional programs mechanically. Unfortunately, automatic verification often fails for functions with accumulating arg...
ICFP
2012
ACM
11 years 10 months ago
2012
ACM
Programming with dependent types is a blessing and a curse. It is a blessing to be able to bake invariants into the definition of datatypes: we can finally write correct-by-cons...
MICRO
2007
IEEE
14 years 1 months ago
2007
IEEE
Snoopy cache coherence can be implemented in any physical network topology by embedding a logical unidirectional ring in the network. Control messages are forwarded using the ring...