Sciweavers

597 search results - page 8 / 120
» Formal Techniques for Java-Like Programs
Sort
View
HASE
1998
IEEE
14 years 26 days ago
Verification in Concurrent Programming with Petri Nets Structural Techniques
This paper deals with verification of flow control in concurrent programs. We use Ada language model as reference. After translation of Ada programs into Petri nets (named Ada net...
Kamel Barkaoui, Jean-François Pradat-Peyre
SAS
2010
Springer
139views Formal Methods» more  SAS 2010»
13 years 7 months ago
Interprocedural Analysis with Lazy Propagation
We propose lazy propagation as a technique for flow- and context-sensitive interprocedural analysis of programs with objects and first-class functions where transfer functions ma...
Simon Holm Jensen, Anders Møller, Peter Thi...
ICFP
2012
ACM
11 years 11 months ago
Proof-producing synthesis of ML from higher-order logic
The higher-order logic found in proof assistants such as Coq and various HOL systems provides a convenient setting for the development and verification of pure functional program...
Magnus O. Myreen, Scott Owens
FMCO
2009
Springer
130views Formal Methods» more  FMCO 2009»
13 years 6 months ago
Interleaving Symbolic Execution and Partial Evaluation
Partial evaluation is a program specialization technique that allows to optimize programs for which partial input is known. We show that partial evaluation can be used with advanta...
Richard Bubel, Reiner Hähnle, Ran Ji
PPDP
2007
Springer
14 years 2 months ago
Formalizing and verifying semantic type soundness of a simple compiler
We describe a semantic type soundness result, formalized in the Coq proof assistant, for a compiler from a simple imperative language with heap-allocated data into an idealized as...
Nick Benton, Uri Zarfaty