Sciweavers

169 search results - page 18 / 34
» Abstract Interpretation of Algebraic Polynomial Systems (Ext...
Sort
View
CADE
2009
Springer
14 years 8 months ago
A Term Rewriting Approach to the Automated Termination Analysis of Imperative Programs
Abstract. An approach based on term rewriting techniques for the automated termination analysis of imperative programs operating on integers is presented. An imperative program is ...
Stephan Falke, Deepak Kapur
TPHOL
2007
IEEE
14 years 1 months ago
HOL2P - A System of Classical Higher Order Logic with Second Order Polymorphism
Abstract. This paper introduces the logical system HOL2P that extends classical higher order logic (HOL) with type operator variables and universal types. HOL2P has explicit term o...
Norbert Völker
VVEIS
2007
13 years 8 months ago
UML-driven Information Systems and their Formal Integration Validation and Distribution
Being the de-facto standard (object-oriented-OO) method(-logy) for software-intensive systems development, UML with its different diagrams and supporting tools represent nowadays t...
Nasreddine Aoumeur, Gunter Saake
RTA
2004
Springer
14 years 25 days ago
TORPA: Termination of Rewriting Proved Automatically
Abstract. In this paper it is described how a combination of polynomial interpretations, recursive path order, RFC match-bounds, the dependency pair method and semantic labelling c...
Hans Zantema
SPIN
2010
Springer
13 years 5 months ago
Time-Bounded Reachability in Distributed Input/Output Interactive Probabilistic Chains
Abstract. We develop an algorithm to compute timed reachability probabilities for distributed models which are both probabilistic and nondeterministic. To obtain realistic results ...
Georgel Calin, Pepijn Crouzen, Pedro R. D'Argenio,...