Sciweavers

3573 search results - page 551 / 715
» Reasoning about Codata
Sort
View
JAR
2010
95views more  JAR 2010»
14 years 10 months ago
Equivariant Unification
Nominal logic is a variant of first-order logic with special facilities for reasoning about names and binding based on the underlying concepts of swapping and freshness. It serves ...
James Cheney
JCST
2010
189views more  JCST 2010»
14 years 10 months ago
Formally Analyzing Expected Time Complexity of Algorithms Using Theorem Proving
Probabilistic techniques are widely used in the analysis of algorithms to estimate the computational complexity of algorithms or a computational problem. Traditionally, such analys...
Osman Hasan, Sofiène Tahar
JLP
2010
85views more  JLP 2010»
14 years 10 months ago
Synchronous Kleene algebra
The work presented here investigates the combination of Kleene algebra with the synchrony model of concurrency from Milner's SCCS calculus. The resulting algebraic structure ...
Cristian Prisacariu
137
Voted
MST
2010
122views more  MST 2010»
14 years 10 months ago
Self-Referential Justifications in Epistemic Logic
This paper is devoted to the study of self-referential proofs and/or justifications, i.e., valid proofs that prove statements about these same proofs. The goal is to investigate wh...
Roman Kuznets
RE
2010
Springer
14 years 10 months ago
A UML-based static verification framework for security
Secure software engineering is a new research area that has been proposed to address security issues during the development of software systems. This new area of research advocates...
Igor Siveroni, Andrea Zisman, George Spanoudakis