Sciweavers

753 search results - page 97 / 151
» Constructing program animations using a pattern-based approa...
Sort
View
SAS
2001
Springer
117views Formal Methods» more  SAS 2001»
14 years 8 days ago
Finite-Tree Analysis for Constraint Logic-Based Languages
Abstract. Logic languages based on the theory of rational, possibly infinite, trees have much appeal in that rational trees allow for faster unification (due to the omission of t...
Roberto Bagnara, Roberta Gori, Patricia M. Hill, E...
ICFP
2002
ACM
14 years 7 months ago
Tagless staged interpreters for typed languages
Multi-stage programming languages provide a convenient notation for explicitly staging programs. Staging a definitional interpreter for a domain specific language is one way of de...
Emir Pasalic, Walid Taha, Tim Sheard
ICALT
2006
IEEE
14 years 1 months ago
Agency Architecture for Teacher Intervention in Robotics Classes
Teachers working in robotics classes face a major problem: how to keep track on individual students’ or even small groups’ progress in a class of 30-40 students. An agency app...
Ilkka Jormanainen, Yuejun Zhang, Erkki Sutinen, Ki...
ICSM
2006
IEEE
14 years 1 months ago
Dynamic Updating of Software Systems Based on Aspects
Long-running applications such as network services require continuous uptime but also frequent changes to the software. To avoid downtime for software maintenance, applications mu...
Susanne Cech Previtali, Thomas R. Gross
CAV
2010
Springer
198views Hardware» more  CAV 2010»
13 years 11 months ago
Termination Analysis with Compositional Transition Invariants
Abstract. Modern termination provers rely on a safety checker to construct disjunctively well-founded transition invariants. This safety check is known to be the bottleneck of the ...
Daniel Kroening, Natasha Sharygina, Aliaksei Tsito...