Sciweavers

1076 search results - page 56 / 216
» Operations on proofs and labels
Sort
View
AMAST
2010
Springer
13 years 2 months ago
Matching Logic: An Alternative to Hoare/Floyd Logic
Abstract. This paper introduces matching logic, a novel framework for defining axiomatic semantics for programming languages, inspired from operational semantics. Matching logic sp...
Grigore Rosu, Chucky Ellison, Wolfram Schulte
ICCV
2009
IEEE
1655views Computer Vision» more  ICCV 2009»
15 years 19 days ago
Shift-Map Image Editing
Geometric rearrangement of images includes operations such as image retargeting, inpainting, or object rearrangement. Each such operation can be characterized by a shiftmap: the...
Yael Pritch, Eitam Kav-Venaki, Shmuel Peleg
TPHOL
2002
IEEE
14 years 17 days ago
Weakest Precondition for General Recursive Programs Formalized in Coq
Abstract. This paper describes a formalization of the weakest precondition, wp, for general recursive programs using the type-theoretical proof assistant Coq. The formalization is ...
Xingyuan Zhang, Malcolm Munro, Mark Harman, Lin Hu
BIRTHDAY
1997
Springer
13 years 11 months ago
Expressive Power of Unary Counters
We compare the expressive power on finite models of two extensions of first order logic L with equality. L(Ct) is formed by adding an operator count{x : ϕ}, which builds a term ...
Michael Benedikt, H. Jerome Keisler
TABLEAUX
2007
Springer
14 years 1 months ago
A Tableau Method for Public Announcement Logics
Public announcement logic is an extension of multi-agent epistemic logic with dynamic operators to model the informational consequences of announcements to the entire group of agen...
Philippe Balbiani, Hans P. van Ditmarsch, Andreas ...