Sciweavers

1055 search results - page 42 / 211
» On the Semantics of Logic Programs with Preferences
Sort
View
FMICS
2008
Springer
13 years 10 months ago
Automated Certification of Non-Interference in Rewriting Logic
Abstract. In this paper we propose a certification technique for noninterference of Java programs based on rewriting logic, a very general logical and semantic framework efficientl...
Mauricio Alba-Castro, María Alpuente, Santi...
IWFM
1998
13 years 10 months ago
Strictly Level-Decreasing Logic Programs
We study strictly level-decreasing logic programs (sld-programs) as defined earlier by the present authors. It will be seen that sld-programs, unlike most other classes of logic p...
Anthony Karel Seda, Pascal Hitzler
LPNMR
2004
Springer
14 years 2 months ago
Logic Programs With Monotone Cardinality Atoms
We investigate mca-programs, that is, logic programs with clauses built of monotone cardinality atoms of the form kX , where k is a non-negative integer and X is a finite set of ...
V. Wiktor Marek, Ilkka Niemelä, Miroslaw Trus...
FMCAD
2008
Springer
13 years 10 months ago
Scaling Up the Formal Verification of Lustre Programs with SMT-Based Techniques
We present a general approach for verifying safety properties of Lustre programs automatically. Key aspects of the approach are the choice of an expressive first-order logic in wh...
George Hagen, Cesare Tinelli
TLDI
2009
ACM
169views Formal Methods» more  TLDI 2009»
14 years 5 months ago
Relational parametricity for references and recursive types
We present a possible world semantics for a call-by-value higherorder programming language with impredicative polymorphism, general references, and recursive types. The model is o...
Lars Birkedal, Kristian Støvring, Jacob Tha...