Sciweavers

754 search results - page 122 / 151
» An Ordered Logic Program Solver
Sort
View
84
Voted
ICLP
1999
Springer
15 years 4 months ago
Computing Large and Small Stable Models
In this paper, we focus on the problem of existence of and computing small and large stable models. We show that for every xed integer k, there is a linear-time algorithm to decid...
Miroslaw Truszczynski
POPL
1993
ACM
15 years 4 months ago
Graph Types
e data structures are abstractions of simple records and pointers. They impose a shape invariant, which is verified at compiletime and exploited to automatically generate code fo...
Nils Klarlund, Michael I. Schwartzbach
99
Voted
JLP
2006
81views more  JLP 2006»
15 years 17 days ago
Development graphs - Proof management for structured specifications
Development graphs are a tool for dealing with structured specifications in a formal program development in order to ease the management of change and reusing proofs. In this work...
Till Mossakowski, Serge Autexier, Dieter Hutter
112
Voted
CEC
2009
IEEE
15 years 7 months ago
What is situated evolution?
—In this paper we discuss the notion of situated evolution. Our treatment includes positioning situated evolution on the map of evolutionary processes in terms of time- and space...
Martijn C. Schut, Evert Haasdijk, A. E. Eiben
92
Voted
CADE
2008
Springer
16 years 28 days ago
Precise Dynamic Verification of Confidentiality
Confidentiality is maybe the most popular security property to be formally or informally verified. Noninterference is a baseline security policy to formalize confidentiality of sec...
Gurvan Le Guernic