Sciweavers

1096 search results - page 76 / 220
» Computation Slicing: Techniques and Theory
Sort
View
BIRTHDAY
2007
Springer
13 years 12 months ago
Automating Verification of Cooperation, Control, and Design in Traffic Applications
We present a verification methodology for cooperating traffic agents covering analysis of cooperation strategies, realization of strategies through control, and implementation of c...
Werner Damm, Alfred Mikschl, Jens Oehlerking, Erns...
DAC
2005
ACM
13 years 10 months ago
Response compaction with any number of unknowns using a new LFSR architecture
This paper presents a new test response compaction technique with any number of unknown logic values (X’s) in the test response bits. The technique leverages an X-tolerant respo...
Erik H. Volkerink, Subhasish Mitra
BIRTHDAY
2010
Springer
13 years 8 months ago
Dynamic Rippling, Middle-Out Reasoning and Lemma Discovery
Abstract. We present a succinct account of dynamic rippling, a technique used to guide the automation of inductive proofs. This simplifies termination proofs for rippling and hence...
Moa Johansson, Lucas Dixon, Alan Bundy
ATAL
2006
Springer
13 years 11 months ago
Junta distributions and the average-case complexity of manipulating elections
Encouraging voters to truthfully reveal their preferences in an election has long been an important issue. Previous studies have shown that some voting protocols are hard to manip...
Ariel D. Procaccia, Jeffrey S. Rosenschein
IPPS
1999
IEEE
14 years 6 days ago
A Structured Approach to Parallel Programming: Methodology and Models
Parallel programming continues to be difficult, despite substantial and ongoing research aimed at making it tractable. Especially dismaying is the gulf between theory and the pract...
Berna L. Massingill