Sciweavers

1941 search results - page 97 / 389
» Reasoning about Computations Using Two-Levels of Logic
Sort
View
CSL
2008
Springer
15 years 5 months ago
Non-finite Axiomatizability and Undecidability of Interval Temporal Logics with C, D, and T
Interval logics are an important area of computer science. Although attention has been mainly focused on unary operators, an early work by Venema (1991) introduced an expressively ...
Ian Hodkinson, Angelo Montanari, Guido Sciavicco
LICS
2012
IEEE
13 years 5 months ago
Graph Logics with Rational Relations and the Generalized Intersection Problem
Abstract—We investigate some basic questions about the interaction of regular and rational relations on words. The primary motivation comes from the study of logics for querying ...
Pablo Barceló, Diego Figueira, Leonid Libki...
LATA
2009
Springer
15 years 10 months ago
Termination of Priority Rewriting
Introducing priorities on rules in rewriting increases their expressive power and helps to limit computations. Priority rewriting is used in rule-based programming as well as in f...
Isabelle Gnaedig
NJC
2006
86views more  NJC 2006»
15 years 3 months ago
Structured Formal Development in Isabelle
Abstract. General purpose theorem provers provide advanced facilities for proving properties about specifications, and may therefore be a valuable tool in formal program developmen...
Maksym Bortin, Einar Broch Johnsen, Christoph L&uu...
TGC
2007
Springer
15 years 9 months ago
Type-Safe Distributed Programming with ML5
Abstract We present ML5, a high level programming language for spatially distributed computing. The language, a variant of ML, allows an entire distributed application to be develo...
Tom Murphy VII, Karl Crary, Robert Harper