Sciweavers

1102 search results - page 67 / 221
» Generalizing Updates: From Models to Programs
Sort
View
ICS
2010
Tsinghua U.
15 years 4 months ago
Memory Consistency Conditions for Self-Assembly Programming
: Perhaps the two most significant theoretical questions about the programming of self-assembling agents are: (1) necessary and sufficient conditions to produce a unique terminal a...
Aaron Sterling
BIRTHDAY
2009
Springer
15 years 4 months ago
Modular Verification of Strongly Invasive Aspects
An extended specification for aspects, and a new verification method based on model checking are used to establish the correctness of strongly-invasive aspects, independently of a...
Emilia Katz, Shmuel Katz
122
Voted
INFORMS
1998
150views more  INFORMS 1998»
15 years 1 days ago
Branch and Infer: A Unifying Framework for Integer and Finite Domain Constraint Programming
constraint abstractions into integer programming, and to discuss possible combinations of the two approaches. Combinatorial problems are ubiquitous in many real world applications ...
Alexander Bockmayr, Thomas Kasper
ICSE
2008
IEEE-ACM
16 years 1 months ago
Incremental state-space exploration for programs with dynamically allocated data
We present a novel technique that speeds up state-space exploration (SSE) for evolving programs with dynamically allocated data. SSE is the essence of explicit-state model checkin...
Steven Lauterburg, Ahmed Sobeih, Darko Marinov, Ma...
108
Voted
SLP
1994
89views more  SLP 1994»
15 years 1 months ago
Signed Logic Programs
In this paper we explore the notion of a \signing" of a logic program, in the framework of the answer set semantics. In particular, we generalize and extend the notion of a s...
Hudson Turner