Sciweavers

1901 search results - page 177 / 381
» Predicting Program Properties from
Sort
View
NFM
2011
242views Formal Methods» more  NFM 2011»
14 years 10 months ago
Model Checking Using SMT and Theory of Lists
A main idea underlying bounded model checking is to limit the length of the potential counter-examples, and then prove properties for the bounded version of the problem. In softwar...
Aleksandar Milicevic, Hillel Kugler
216
Voted
ESOP
2009
Springer
15 years 10 months ago
Global Principal Typing in Partially Commutative Asynchronous Sessions
We generalise a theory of multiparty session types for the π-calculus through asynchronous communication subtyping, which allows partial commutativity of actions with maximal fle...
Dimitris Mostrous, Nobuko Yoshida, Kohei Honda
EUROPAR
2004
Springer
15 years 8 months ago
More Legal Transformations for Locality
Abstract. Program transformations are one of the most valuable compiler techniques to improve data locality. However, restructuring compilers have a hard time coping with data depe...
Cédric Bastoul, Paul Feautrier
ICFP
1999
ACM
15 years 7 months ago
A Simple Proof Technique for Certain Parametricity Results
Many properties of parametric, polymorphic functions can be determined simply by inspection of their types. Such results are usually proven using Reynolds's parametricity the...
Karl Crary
ECOOP
2008
Springer
15 years 5 months ago
Extensible Universes for Object-Oriented Data Models
Abstract We present a datatype package that enables the shallow embedding technique to object-oriented specification and programming languages. This datatype package incrementally ...
Achim D. Brucker, Burkhart Wolff