Sciweavers

685 search results - page 57 / 137
» Implementing Controlled Languages in GF
Sort
View
PLDI
2012
ACM
13 years 7 days ago
Proving acceptability properties of relaxed nondeterministic approximate programs
Approximate program transformations such as skipping tasks [29, 30], loop perforation [21, 22, 35], reduction sampling [38], multiple selectable implementations [3, 4, 16, 38], dy...
Michael Carbin, Deokhwan Kim, Sasa Misailovic, Mar...
JLP
2000
109views more  JLP 2000»
14 years 9 months ago
Demand Transformation Analysis for Concurrent Constraint Programs
interpretation. In the context of stream parallelism, this analysis identi es an amount of input data for which predicate execution can safely wait without danger of introducing de...
Moreno Falaschi, Patrick Hicks, William H. Winsbor...
ROBOCUP
2000
Springer
120views Robotics» more  ROBOCUP 2000»
15 years 1 months ago
Towards a Logical Approach for Soccer Agents Engineering
Building agents for a scenario such as the RoboCup simulation league requires not only methodologies for implementing high-level complex behavior, but also the careful and efficien...
Jan Murray, Oliver Obst, Frieder Stolzenburg
ICLP
2003
Springer
15 years 3 months ago
On Deterministic Computations in the Extended Andorra Model
Logic programming is based on the idea that computation is controlled inference. The Extended Andorra Model provides a very powerful framework that supports both co-routining and p...
Ricardo Lopes, Vítor Santos Costa, Fernando...
ICCD
1992
IEEE
126views Hardware» more  ICCD 1992»
15 years 1 months ago
High-Level State Machine Specification and Synthesis
Current synthesis methodologies based on hardwaredescription languages focus mainly on two distinct levels: behavior and register-transfer levels. In many practical cases, however...
Andreas Kuehlmann, Reinaldo A. Bergamaschi