Sciweavers

838 search results - page 36 / 168
» From Natural Language to Formal Proof Goal
Sort
View
POLICY
2005
Springer
15 years 11 months ago
Deriving Semantic Models from Privacy Policies
Natural language policies describe interactions between and across organizations, third-parties and individuals. However, current policy languages are limited in their ability to ...
Travis D. Breaux, Annie I. Antón
SAT
2007
Springer
118views Hardware» more  SAT 2007»
16 years 6 days ago
Improved Lower Bounds for Tree-Like Resolution over Linear Inequalities
Abstract. We continue a study initiated by Kraj´ıˇcek of a Resolutionlike proof system working with clauses of linear inequalities, R(CP). For all proof systems of this kind Kra...
Arist Kojevnikov
EGOV
2010
Springer
15 years 7 months ago
From Policy-Making Statements to First-Order Logic
Within a framework for enriched on-line discussion forums for e-government policy-making, pro and con statements for positions are input, structurally related, then logically repre...
Adam Wyner, Tom M. van Engers, Kiavash Bahreini
POPL
2012
ACM
14 years 1 months ago
Playing in the grey area of proofs
Interpolation is an important technique in verification and static analysis of programs. In particular, interpolants extracted from proofs of various properties are used in invar...
Krystof Hoder, Laura Kovács, Andrei Voronko...
SBMF
2010
Springer
205views Formal Methods» more  SBMF 2010»
15 years 25 days ago
A High-Level Language for Modeling Algorithms and Their Properties
Designers of concurrent and distributed algorithms usually express them using pseudo-code. In contrast, most verification techniques are based on more mathematically-oriented forma...
Sabina Akhtar, Stephan Merz, Martin Quinson