Sciweavers

49 search results - page 3 / 10
» Return-oriented programming without returns
Sort
View
EMSOFT
2011
Springer
12 years 7 months ago
From boolean to quantitative synthesis
Motivated by improvements in constraint-solving technology and by the increase of routinely available computational power, partial-program synthesis is emerging as an effective a...
Pavol Cerný, Thomas A. Henzinger
LOGCOM
2011
12 years 10 months ago
Introducing Preferences in Planning as Satisfiability
Planning as Satisfiability is one of the most well-known and effective techniques for classical planning: satplan has been the winning system in the deterministic track for optim...
Enrico Giunchiglia, Marco Maratea
ICLP
2007
Springer
13 years 11 months ago
Web Sites Verification: An Abductive Logic Programming Tool
We present the CIFFWEB system, an innovative tool for the verification of web sites, relying upon abductive logic programming. The system allows the user to define rules that a web...
Paolo Mancarella, Giacomo Terreni, Francesca Toni
ESOP
2008
Springer
13 years 9 months ago
Semi-persistent Data Structures
A data structure is said to be persistent when any update operation returns a new structure without altering the old version. This paper introduces a new notion of persistence, cal...
Sylvain Conchon, Jean-Christophe Filliâtre
COMPUTER
1998
94views more  COMPUTER 1998»
13 years 7 months ago
Multiprocessors Should Support Simple Memory-Consistency Models
provide tools or abstractions that allow developers to program in parallel. But what hardware do we need to support shared memory threads? The hardware should provide a well-defin...
Mark D. Hill