Sciweavers

1143 search results - page 218 / 229
» Abstract Syntax and Logic Programming
Sort
View
SIGSOFT
2006
ACM
14 years 8 months ago
Lightweight extraction of syntactic specifications
A method for extracting syntactic specifications from heapmanipulating code is described. The state of the heap is represented as an environment mapping each variable or field to ...
Mana Taghdiri, Robert Seater, Daniel Jackson
CADE
2009
Springer
14 years 8 months ago
Solving Non-linear Polynomial Arithmetic via SAT Modulo Linear Arithmetic
Abstract. Polynomial constraint-solving plays a prominent role in several areas of engineering and software verification. In particular, polynomial constraint solving has a long an...
Albert Rubio, Cristina Borralleras, Enric Rodr&iac...
ICALP
2009
Springer
14 years 7 months ago
High Complexity Tilings with Sparse Errors
Abstract. Tile sets and tilings of the plane appear in many topics ranging from logic (the Entscheidungsproblem) to physics (quasicrystals). The idea is to enforce some global prop...
Bruno Durand, Andrei E. Romashchenko, Alexander Sh...
CEC
2008
IEEE
14 years 1 months ago
Finding liveness errors with ACO
Abstract— Model Checking is a well-known and fully automatic technique for checking software properties, usually given as temporal logic formulae on the program variables. Most o...
J. Francisco Chicano, Enrique Alba
ICRA
2007
IEEE
157views Robotics» more  ICRA 2007»
14 years 1 months ago
Distributed Watchpoints: Debugging Large Multi-Robot Systems
Abstract— Tightly-coupled multi-agent systems such as modular robots frequently exhibit properties of interest that span multiple modules. These properties cannot easily be detec...
Michael DeRosa, Jason Campbell, Padmanabhan Pillai...