553 search results - page 7 / 111 » Verified, Executable Parsing |
SPIN
2004
Springer
14 years 2 months ago
2004
Springer
The notion that certain procedures are atomic provides a valuable partial specification for many multithreaded software systems. Several existing tools verify atomicity by showing...
ACL
2006
13 years 10 months ago
2006
Spoken monologues feature greater sentence length and structural complexity than do spoken dialogues. To achieve high parsing performance for spoken monologues, it could prove eff...
ICECCS
2000
IEEE
14 years 1 months ago
2000
IEEE
The goal of result-verificationis toprove that one execution run of a program satisjes its speciJcation. Compared with iniplenzentation-verification,result-verification has a larg...
JAR
2006
13 years 8 months ago
2006
We describe an approach to verifying bit-level pipelined machine models using a combination of deductive reasoning and decision procedures. While theorem proving systems such as AC...
SPAA
2003
ACM
14 years 2 months ago
2003
ACM
The general problem of verifying coherence for shared-memory multiprocessor executions is NP-Complete. Verifying memory consistency models is therefore NP-Hard, because memory con...