Sciweavers

561 search results - page 29 / 113
» Slicing of Constraint Logic Programs
Sort
View
CHARME
2003
Springer
196views Hardware» more  CHARME 2003»
15 years 10 months ago
Analyzing the Intel Itanium Memory Ordering Rules Using Logic Programming and SAT
We present a non-operational approach to specifying and analyzing shared memory consistency models. The method uses higher order logic to capture a complete set of ordering constra...
Yue Yang, Ganesh Gopalakrishnan, Gary Lindstrom, K...
FROCOS
2000
Springer
15 years 8 months ago
Compiling Multi-Paradigm Declarative Programs into Prolog
This paper describes a high-level implementation of the concurrent constraint functional logic language Curry. The implementation, directed by the lazy pattern matching strategy of...
Sergio Antoy, Michael Hanus
LPAR
1992
Springer
15 years 9 months ago
From the Past to the Future: Executing Temporal Logic Programs
We describe some of the techniques which have been used to implement METATEM, a programming language based on temporal logic, and address problems such as non-determinism and loopi...
Michael Fisher, Richard Owens
PLDI
2009
ACM
15 years 12 months ago
On PDG-based noninterference and its modular proof
We present the first machine-checked correctness proof for information flow control (IFC) based on program dependence graphs (PDGs). IFC based on slicing and PDGs is flow-sensi...
Daniel Wasserrab, Denis Lohner, Gregor Snelting
CADE
2001
Springer
16 years 5 months ago
A Sequent Calculus for First-Order Dynamic Logic with Trace Modalities
The modalities of Dynamic Logic refer to the final state of a program execution and allow to specify programs with pre- and postconditions. In this paper, we extend Dynamic Logic w...
Bernhard Beckert, Steffen Schlager