Sciweavers

647 search results - page 40 / 130
» Generic Trace Logics
Sort
View
ESOP
2007
Springer
15 years 6 months ago
Probabilistic Anonymity Via Coalgebraic Simulations
There is a growing concern on anonymity and privacy on the Internet, resulting in lots of work on formalization and verification of anonymity. Especially, importance of probabilis...
Ichiro Hasuo, Yoshinobu Kawabe
AIFIPP
1992
15 years 1 months ago
Task-Structure Analysis for Knowledge Modeling
We have for several years been working on an approach to knowledge system building that argues for the existence of a close connection between the tasks which the knowledge system ...
B. Chandrasekaran, Todd R. Johnson, Jack W. Smith
LOGCOM
2010
87views more  LOGCOM 2010»
14 years 10 months ago
Exemplaric Expressivity of Modal Logics
Abstract This paper investigates expressivity of modal logics for transition systems, multitransition systems, Markov chains, and Markov processes, as coalgebras of the powerset, ...
Bart Jacobs, Ana Sokolova
TCAD
2010
136views more  TCAD 2010»
14 years 6 months ago
Bounded Model Debugging
Design debugging is a major bottleneck in modern VLSI design flows as both the design size and the length of the error trace contribute to its inherent complexity. With typical des...
Brian Keng, Sean Safarpour, Andreas G. Veneris
CADE
2009
Springer
16 years 13 days ago
Efficient Intuitionistic Theorem Proving with the Polarized Inverse Method
The inverse method is a generic proof search procedure applicable to non-classical logics satisfying cut elimination and the subformula property. In this paper we describe a genera...
Sean McLaughlin, Frank Pfenning