Sciweavers

4192 search results - page 438 / 839
» Probabilistic Logic Programming
Sort
View
ISSTA
2004
ACM
15 years 10 months ago
An optimizing compiler for batches of temporal logic formulas
Model checking based on validating temporal logic formulas has proven practical and effective for numerous software engineering applications. As systems based on this approach ha...
James Ezick
POPL
1992
ACM
15 years 9 months ago
Abstract Semantics for a Higher-Order Functional Language with Logic Variables
Semantics for a Higher-Order Functional Language with Logic Variables Radha Jagadeesan Imperial College, London, UK SW7 2BZ. Keshav Pingali Cornell University, Ithaca, NY 14853. A...
Radha Jagadeesan, Keshav Pingali
ER
1995
Springer
152views Database» more  ER 1995»
15 years 8 months ago
A Logic Framework for a Semantics of Object-Oriented Data Modeling
We describe a (meta) formalism for defining a variety of (object oriented) data models in a unified framework based on a variation of first-order logic. As specific example we use...
Olga De Troyer, Robert Meersman
ENTCS
2000
120views more  ENTCS 2000»
15 years 4 months ago
Efficient Substitution in Hoare Logic Expressions
Substitution plays an important role in Hoare Logic, as it is used in interpreting assignments. When writing a computer-based realization of Hoare Logic, it is therefore important...
Roberto Virga
STOC
2001
ACM
123views Algorithms» more  STOC 2001»
16 years 5 months ago
On optimal slicing of parallel programs
Optimal program slicing determines for a statement S in a program whether or not S affects a specified set of statements, given that all conditionals in are interpreted as non-d...
Markus Müller-Olm, Helmut Seidl