Sciweavers

271 search results - page 8 / 55
» A comparison between two logical formalisms for rewriting
Sort
View
ASE
2005
137views more  ASE 2005»
13 years 7 months ago
Rewriting-Based Techniques for Runtime Verification
Techniques for efficiently evaluating future time Linear Temporal Logic (abbreviated LTL) formulae on finite execution traces are presented. While the standard models of LTL are i...
Grigore Rosu, Klaus Havelund
CORR
2010
Springer
116views Education» more  CORR 2010»
13 years 8 months ago
Dist-Orc: A Rewriting-based Distributed Implementation of Orc with Formal Analysis
Abstract. Orc is a theory of orchestration of services that allows structured programming of distributed and timed computations. Several formal semantics have been proposed for Orc...
Musab AlTurki, José Meseguer
ENTCS
2000
112views more  ENTCS 2000»
13 years 7 months ago
Typed Multiset Rewriting Specifications of Security Protocols
The language MSR has successfully been used in the past to prove undecidability about security protocols modeled according to the Dolev-Yao abstraction. In this paper, we revise t...
Iliano Cervesato
JOLLI
2010
118views more  JOLLI 2010»
13 years 6 months ago
Merging DEL and ETL
This paper surveys the interface between the two major logical trends that describe agents’ intelligent interaction over time: dynamic epistemic logic (DEL) and epistemic tempora...
Tomohiro Hoshi
DLOG
2008
13 years 10 months ago
Subsumption Propagation between Remote Ontologies in Distributed Description Logic
Distributed Description Logics (DDL) is a KR formalism that enables reasoning with multiple ontologies interconnected by directional semantic mapping. Subsumption propagation in DD...
Martin Homola