Sciweavers

3742 search results - page 223 / 749
» On the Use of Formal Techniques for Validation
Sort
View
LATA
2009
Springer
16 years 1 months ago
Termination of Priority Rewriting
Introducing priorities on rules in rewriting increases their expressive power and helps to limit computations. Priority rewriting is used in rule-based programming as well as in f...
Isabelle Gnaedig
INFOCOM
2003
IEEE
15 years 11 months ago
Server-based Inference of Internet Link Lossiness
— We investigate the problem of inferring the packet loss characteristics of Internet links using server-based measurements. Unlike much of existing work on network tomography th...
Venkata N. Padmanabhan, Lili Qiu, Helen J. Wang
ATS
2009
IEEE
142views Hardware» more  ATS 2009»
16 years 1 months ago
Speeding up SAT-Based ATPG Using Dynamic Clause Activation
Abstract—SAT-based ATPG turned out to be a robust alternative to classical structural ATPG algorithms such as FAN. The number of unclassified faults can be significantly reduce...
Stephan Eggersglüß, Daniel Tille, Rolf ...
AAAI
2011
14 years 6 months ago
Recognizing Plans with Loops Represented in a Lexicalized Grammar
This paper extends existing plan recognition research to handle plans containing loops. We supply an encoding of plans with loops for recognition, based on techniques used to pars...
Christopher W. Geib, Robert P. Goldman
CADE
2005
Springer
16 years 6 months ago
Reflecting Proofs in First-Order Logic with Equality
Our general goal is to provide better automation in interactive proof assistants such as Coq. We present an interpreter of proof traces in first-order multi-sorted logic with equal...
Evelyne Contejean, Pierre Corbineau