Sciweavers

4460 search results - page 340 / 892
» Formal methods for interactive systems
Sort
View
SAS
2001
Springer
116views Formal Methods» more  SAS 2001»
15 years 11 months ago
Applying Static Analysis Techniques for Inferring Termination Conditions of Logic Programs
We present the implementation of cTI, a system for universal left-termination inference of logic programs, which heavily relies on static analysis techniques. Termination inference...
Frédéric Mesnard, Ulrich Neumerkel
AGTIVE
1999
Springer
15 years 11 months ago
DiTo - A Distribution Tool Based on Graph Rewriting
Abstract. In the paper Support for Design Patterns through Graph Transformation Tools in this volume, we have already outlined the global structure of a tool that allows for the an...
Ansgar Radermacher
IFL
1998
Springer
113views Formal Methods» more  IFL 1998»
15 years 11 months ago
Shared Memory Multiprocessor Support for SAC
Abstract. Sac (Single Assignment C) is a strict, purely functional programming language primarily designed with numerical applications in mind. Particular emphasis is on efficient ...
Clemens Grelck
AGTIVE
2007
Springer
15 years 10 months ago
Model-Driven Software Development with Graph Transformations: A Comparative Case Study
Abstract. Significant achievements have been made in the design and implementation of languages and tools for graph transformation systems. However, many other competing approaches...
Thomas Buchmann, Alexander Dotor, Sabrina Uhrig, B...
FORMATS
2007
Springer
15 years 10 months ago
Efficient On-the-Fly Algorithms for Partially Observable Timed Games
In this paper, we review some recent results on the efficient synthesis of controllers for timed systems. We first recall the basics of controller synthesis for timed games and the...
Franck Cassez