Sciweavers

1375 search results - page 159 / 275
» SDL-2000: A Language with a Formal Semantics
Sort
View
PPDP
2009
Springer
15 years 4 months ago
Set functions for functional logic programming
We propose a novel approach to encapsulate non-deterministic computations in functional logic programs. Our approach is based on set functions that return the set of all the resul...
Sergio Antoy, Michael Hanus
CORR
2000
Springer
133views Education» more  CORR 2000»
14 years 9 months ago
On Exponential-Time Completeness of the Circularity Problem for Attribute Grammars
Attribute grammars (AGs) are a formal technique for defining semantics of programming languages. Existing complexity proofs on the circularity problem of AGs are based on automata...
Pei-Chi Wu
DMS
2010
203views Multimedia» more  DMS 2010»
14 years 8 months ago
Recognizing Sketches of Euler Diagrams Drawn with Ellipses
Euler diagrams form the basis of a number of visual languages. However, the existing tool support for creating Euler diagrams is limited to generic diagram editing software that u...
Aidan Delaney, Beryl Plimmer, Gem Stapleton, Peter...
ICLP
2010
Springer
14 years 8 months ago
Runtime Addition of Integrity Constraints in an Abductive Proof Procedure
Abductive Logic Programming is a computationally founded representation of abductive reasoning. In most ALP frameworks, integrity constraints express domainspecific logical relati...
Marco Alberti, Marco Gavanelli, Evelina Lamma
88
Voted
ESOP
2007
Springer
15 years 1 months ago
A Certified Lightweight Non-interference Java Bytecode Verifier
Non-interference is a semantical condition on programs that guarantees the absence of illicit information flow throughout their execution, and that can be enforced by appropriate i...
Gilles Barthe, David Pichardie, Tamara Rezk