Sciweavers

187 search results - page 29 / 38
» On Expressive and Model Checking Power of Propositional Prog...
Sort
View
PLDI
2009
ACM
14 years 8 months ago
A decision procedure for subset constraints over regular languages
Reasoning about string variables, in particular program inputs, is an important aspect of many program analyses and testing frameworks. Program inputs invariably arrive as strings...
Pieter Hooimeijer, Westley Weimer
TABLEAUX
2000
Springer
13 years 11 months ago
Benchmark Analysis with FaCT
FaCT (Fast Classification of Terminologies) is a Description Logic (DL) classifier that can also be used for modal logic satisfiability testing. The FaCT system includes two reason...
Ian Horrocks
CADE
2007
Springer
14 years 8 months ago
Dependency Pairs for Rewriting with Non-free Constructors
Abstract. A method based on dependency pairs for showing termination of functional programs on data structures generated by constructors with relations is proposed. A functional pr...
Stephan Falke, Deepak Kapur
ESWS
2006
Springer
13 years 11 months ago
The Web Service Modeling Language WSML: An Overview
The Web Service Modeling Language (WSML) is a language for the specification of different aspects of Semantic Web Services. It provides a formal language for the Web Service Modeli...
Jos de Bruijn, Holger Lausen, Axel Polleres, Diete...
ATVA
2010
Springer
128views Hardware» more  ATVA 2010»
13 years 8 months ago
What's Decidable about Sequences?
Abstract. We present a first-order theory of (finite) sequences with integer elements, Presburger arithmetic, and regularity constraints, which can model significant properties of ...
Carlo A. Furia