Sciweavers

176 search results - page 28 / 36
» Solving Goals in Equational Languages
Sort
View
CGO
2008
IEEE
14 years 2 months ago
Fast liveness checking for ssa-form programs
Liveness analysis is an important analysis in optimizing compilers. Liveness information is used in several optimizations and is mandatory during the code-generation phase. Two dr...
Benoit Boissinot, Sebastian Hack, Daniel Grund, Be...
ESOP
2007
Springer
14 years 1 months ago
On the Implementation of Construction Functions for Non-free Concrete Data Types
Abstract. Many algorithms use concrete data types with some additional invariants. The set of values satisfying the invariants is often a set of representatives for the equivalence...
Frédéric Blanqui, Thérè...
SAS
1992
Springer
171views Formal Methods» more  SAS 1992»
13 years 11 months ago
Static Analysis of CLP Programs over Numeric Domains
Abstract Constraint logic programming (CLP) is a generalization of the pure logic programming paradigm, having similar model-theoretic, fixpoint and operational semantics [9]. Sinc...
Roberto Bagnara, Roberto Giacobazzi, Giorgio Levi
ICRA
2006
IEEE
225views Robotics» more  ICRA 2006»
14 years 1 months ago
Constraint Optimization Coordination Architecture for Search and Rescue Robotics
— The dangerous and time sensitive nature of a disaster area makes it an ideal application for robotic exploration. Our long term goal is to enable humans, software agents, and a...
Mary Koes, Illah R. Nourbakhsh, Katia P. Sycara
SEMWEB
2004
Springer
14 years 27 days ago
Dynamic Agent Composition from Semantic Web Services
Abstract. The shift from Web pages to Web services enables programmatic access to the near limitless information on the World Wide Web. Autonomous agents should generate concise an...
Michael Czajkowski, Anna L. Buczak, Martin O. Hofm...