Sciweavers

1143 search results - page 106 / 229
» Abstract Syntax and Logic Programming
Sort
View
135
Voted
CADE
2008
Springer
16 years 5 months ago
Compositional Proofs with Symbolic Execution
Abstract. A proof method is described which combines compositional proofs of interleaved parallel programs with the intuitive and highly automatic strategy of symbolic execution. A...
Simon Bäumler, Florian Nafz, Michael Balser, ...
147
Voted
FLOPS
1999
Springer
15 years 9 months ago
Using Types as Approximations for Type Checking Prolog Programs
Abstract. Subtyping tends to undermine the effects of parametric polymorphism as far as the static detection of type errors is concerned. Starting with this observation we present...
Christoph Beierle, Gregor Meyer
CADE
1992
Springer
15 years 8 months ago
IMPS: System Description
network of theories. Results are typically proved in compact, abstract theories, and then transported as needed to more concrete theories, or indeed to Supported by the MITRE-Spon...
William M. Farmer, Joshua D. Guttman, F. Javier Th...
LICS
2005
IEEE
15 years 10 months ago
Model Checking Vs. Generalized Model Checking: Semantic Minimizations for Temporal Logics
Three-valued models, in which properties of a system are either true, false or unknown, have recently been advocated as a better representation for reactive program abstractions g...
Patrice Godefroid, Michael Huth
COORDINATION
2008
Springer
15 years 6 months ago
Formalizing Higher-Order Mobile Embedded Business Processes with Binding Bigraphs
Abstract. We propose and formalize HomeBPEL, a higher-order WSBPEL-like business process execution language where processes are firstclass values that can be stored in variables, p...
Mikkel Bundgaard, Arne J. Glenstrup, Thomas T. Hil...