Sciweavers

839 search results - page 123 / 168
» Answer Set Programming with Resources
Sort
View
ICCS
2007
Springer
13 years 11 months ago
Building Verifiable Sensing Applications Through Temporal Logic Specification
Abstract. Sensing is at the core of virtually every DDDAS application. Sensing applications typically involve distributed communication and coordination over large self-organized n...
Asad Awan, Ahmed H. Sameh, Suresh Jagannathan, Ana...
PLDI
2010
ACM
14 years 5 months ago
The Reachability-Bound Problem
We define the reachability-bound problem to be the problem of finding a symbolic worst-case bound on the number of times a given control location inside a procedure is visited in ...
Sumit Gulwani, Florian Zuleger
ICCD
2007
IEEE
139views Hardware» more  ICCD 2007»
14 years 4 months ago
Statistical simulation of chip multiprocessors running multi-program workloads
This paper explores statistical simulation as a fast simulation technique for driving chip multiprocessor (CMP) design space exploration. The idea of statistical simulation is to ...
Davy Genbrugge, Lieven Eeckhout
KBSE
2000
IEEE
14 years 1 days ago
Using Little-JIL to Coordinate Agents in Software Engineering
Little-JIL, a new language for programming the coordination of agents is an executable, high-level process programming language with a formal (yet graphical) syntax and rigorously...
Alexander E. Wise, Aaron G. Cass, Barbara Staudt L...
CORR
2006
Springer
91views Education» more  CORR 2006»
13 years 7 months ago
Quasi-friendly sup-interpretations
In a previous paper [16], the sup-interpretation method was proposed as a new tool to control memory resources of first order functional programs with pattern matching by static an...
Jean-Yves Marion, Romain Péchoux