Sciweavers

597 search results - page 85 / 120
» Formal Techniques for Java-Like Programs
Sort
View
ICFP
2010
ACM
13 years 8 months ago
The impact of higher-order state and control effects on local relational reasoning
Reasoning about program equivalence is one of the oldest problems in semantics. In recent years, useful techniques have been developed, based on bisimulations and logical relation...
Derek Dreyer, Georg Neis, Lars Birkedal
SIGSOFT
2003
ACM
14 years 25 days ago
Evaluating and improving the automatic analysis of implicit invocation systems
Model checking and other finite-state analysis techniques have been very successful when used with hardware systems and less successful with software systems. It is especially di...
Jeremy S. Bradbury, Jürgen Dingel
PLDI
2010
ACM
13 years 11 months ago
Bringing Extensibility to Verified Compilers
Verified compilers, such as Leroy's CompCert, are accompanied by a fully checked correctness proof. Both the compiler and proof are often constructed with an interactive proo...
Zachary Tatlock, Sorin Lerner
POPL
2000
ACM
13 years 11 months ago
Modular Refinement of Hierarchic Reactive Machines
with existing analysis tools. Modular reasoning principles such as abstraction, compositional refinement, and assume-guarantee reasoning are well understood for architectural hiera...
Rajeev Alur, Radu Grosu
POPL
2010
ACM
14 years 5 months ago
A Relational Modal Logic for Higher-Order Stateful ADTs
The method of logical relations is a classic technique for proving the equivalence of higher-order programs that implement the same observable behavior but employ different intern...
Derek Dreyer, Georg Neis, Andreas Rossberg, Lars B...