Sciweavers

496 search results - page 55 / 100
» A formal framework for synthesis and verification of logic p...
Sort
View
POPL
2005
ACM
14 years 8 months ago
Transition predicate abstraction and fair termination
on Predicate Abstraction and Fair Termination Andreas Podelski Andrey Rybalchenko Max-Planck-Institut f?ur Informatik Saarbr?ucken, Germany Predicate abstraction is the basis of m...
Andreas Podelski, Andrey Rybalchenko
POPL
2009
ACM
14 years 8 months ago
Verifying distributed systems: the operational approach
This work develops an integrated approach to the verification of behaviourally rich programs, founded directly on operational semantics. The power of the approach is demonstrated ...
Tom Ridge
VLDB
2002
ACM
156views Database» more  VLDB 2002»
13 years 7 months ago
A Logical Framework for Scheduling Workflows under Resource Allocation Constraints
A workflow consists of a collection of coordinated tasks designed to carry out a welldefined complex process, such as catalog ordering, trip planning, or a business process in an ...
Pinar Senkul, Michael Kifer, Ismail Hakki Toroslu
JFP
2007
111views more  JFP 2007»
13 years 7 months ago
Mechanizing metatheory in a logical framework
The LF logical framework codifies a methodology for representing deductive systems, such as programming languages and logics, within a dependently typed λ-calculus. In this meth...
Robert Harper, Daniel R. Licata
POPL
2004
ACM
14 years 8 months ago
Simple relational correctness proofs for static analyses and program transformations
We show how some classical static analyses for imperative programs, and the optimizing transformations which they enable, may be expressed and proved correct using elementary logi...
Nick Benton