Sciweavers

1486 search results - page 232 / 298
» A Logically Saturated Extension of
Sort
View
LISP
2008
96views more  LISP 2008»
15 years 5 months ago
Dynamic slicing of lazy functional programs based on redex trails
Abstract. Tracing computations is a widely used methodology for program debugging. Lazy languages, however, pose new demands on tracing techniques because following the actual trac...
Claudio Ochoa, Josep Silva, Germán Vidal
UTP
2010
15 years 4 months ago
Unifying Theories in Isabelle/HOL
In this paper, we present various extensions of Isabelle/HOL by theories that are essential for several formal methods. First, we explain how we have developed an Isabelle/HOL theo...
Abderrahmane Feliachi, Marie-Claude Gaudel, Burkha...
ECAI
2010
Springer
15 years 3 months ago
LTL Goal Specifications Revisited
The language of linear temporal logic (LTL) has been proposed as a formalism for specifying temporally extended goals and search control constraints in planning. However, the seman...
Andreas Bauer 0002, Patrik Haslum
ER
2010
Springer
164views Database» more  ER 2010»
15 years 3 months ago
Querying Databases with Taxonomies
Traditional information search in which queries are posed against a known and rigid schema over a structured database is shifting towards a Web scenario in which exposed schemas ar...
Davide Martinenghi, Riccardo Torlone
CISC
2009
Springer
148views Cryptology» more  CISC 2009»
15 years 3 months ago
Using Strategy Objectives for Network Security Analysis
The anticipation game framework is an extension of attack graphs based on game theory. It is used to anticipate and analyze intruder and administrator concurrent interactions with ...
Elie Bursztein, John C. Mitchell