Sciweavers

4340 search results - page 335 / 868
» Formal Methods and Cryptography
Sort
View
CORR
2000
Springer
107views Education» more  CORR 2000»
15 years 6 months ago
Computing Presuppositions by Contextual Reasoning
This paper describes howautomated deduction methods for natural language processing can be applied moreefficiently by encodingcontext in a moreelaborate way. Our workis based on f...
Christof Monz
166
Voted
CORR
2010
Springer
96views Education» more  CORR 2010»
15 years 4 months ago
A Simple Correctness Proof for Magic Transformation
The paper presents a simple and concise proof of correctness of the magic transformation. We believe it may provide a useful example of formal reasoning about logic programs. The ...
Wlodzimierz Drabent
FMCAD
2007
Springer
15 years 10 months ago
Circuit Level Verification of a High-Speed Toggle
As VLSI fabrication technology progresses to 65nm feature sizes and smaller, transistors no longer operate as ideal switches. This motivates verifying digital circuits using contin...
Chao Yan, Mark R. Greenstreet
TKDE
2012
212views Formal Methods» more  TKDE 2012»
13 years 9 months ago
Segmentation and Sampling of Moving Object Trajectories Based on Representativeness
—Moving Object Databases (MOD), although ubiquitous, still call for methods that will be able to understand, search, analyze, and browse their spatiotemporal content. In this pap...
Costas Panagiotakis, Nikos Pelekis, Ioannis Kopana...
CAV
2003
Springer
108views Hardware» more  CAV 2003»
15 years 12 months ago
Linear Invariant Generation Using Non-linear Constraint Solving
Abstract. We present a new method for the generation of linear invariants which reduces the problem to a non-linear constraint solving problem. Our method, based on Farkas’ Lemma...
Michael Colón, Sriram Sankaranarayanan, Hen...