Filters








15,127 Hits in 3.3 sec

Traceability and model checking to support safety requirement verification

Shuanglong Kan
2014 Proceedings of the 22nd ACM SIGSOFT International Symposium on Foundations of Software Engineering - FSE 2014  
Third, the checking of a program against a safety requirement is decomposed into smaller model checking problems by utilizing traceability information model between them.  ...  My research is concerned with applying model checking to verify the conformance between safety requirements and programs.  ...  Bounded Model Checking (BMC) [5] is an efficient SMC for finding bugs in programs, but it cannot provide proofs for the correctness of programs.  ... 
doi:10.1145/2635868.2666606 dblp:conf/sigsoft/Kan14 fatcat:zhbqidyqgzerfdz6hqvqnllw4m

On systematic design of globally consistent executable assertions in embedded software

Arshad Jhumka, Martin Hiller, Vilgot Claesson, Neeraj Suri
2002 Proceedings of the joint conference on Languages, compilers and tools for embedded systems software and compilers for embedded systems - LCTES/SCOPES '02  
In the first pass, we introduce the consistency property of EAs and use it to ascertain global conformity across all EAs.  ...  We address the issue of ascertaining whether localized EAs in individual modules add up complementarily to implement a global EA/property.  ...  However, given that EAs are defined at certain program point to check for erroneous states, we modify the abstract context according to the value constraints defined by EAs.  ... 
doi:10.1145/513841.513843 fatcat:v6madwhr65gkbp5ct4xf627ux4

On systematic design of globally consistent executable assertions in embedded software

Arshad Jhumka, Martin Hiller, Vilgot Claesson, Neeraj Suri
2002 Proceedings of the joint conference on Languages, compilers and tools for embedded systems software and compilers for embedded systems - LCTES/SCOPES '02  
In the first pass, we introduce the consistency property of EAs and use it to ascertain global conformity across all EAs.  ...  We address the issue of ascertaining whether localized EAs in individual modules add up complementarily to implement a global EA/property.  ...  However, given that EAs are defined at certain program point to check for erroneous states, we modify the abstract context according to the value constraints defined by EAs.  ... 
doi:10.1145/513829.513843 dblp:conf/lctrts/JhumkaHCS02 fatcat:6pqv7jwh5zehflibqbfyvlklga

On systematic design of globally consistent executable assertions in embedded software

Arshad Jhumka, Martin Hiller, Vilgot Claesson, Neeraj Suri
2002 SIGPLAN notices  
In the first pass, we introduce the consistency property of EAs and use it to ascertain global conformity across all EAs.  ...  We address the issue of ascertaining whether localized EAs in individual modules add up complementarily to implement a global EA/property.  ...  However, given that EAs are defined at certain program point to check for erroneous states, we modify the abstract context according to the value constraints defined by EAs.  ... 
doi:10.1145/566225.513843 fatcat:7vrcylvhbjaqjei44bcym5yana

Page 13 of Ranch and Rural Living Vol. 42, Issue 3 [page]

1961 Ranch and Rural Living  
Made by a nationwide steel company to high American standards, CFal Wolf- Proof Fence is supplied on full-length, 20-rod rolls.  ...  If all three of these sources of Maybe Feed “CARBOTEX” for MITTEE TEETER all | ea Separate the sheep from the wolves... with CFsI Wolf-Proof Fence This sturdy, rust-resistant fence is the ideal way to  ... 

Reasoning with minimal models: efficient algorithms and applications

Rachel Ben-Eliyahu-Zohary, Luigi Palopoli
1997 Artificial Intelligence  
In this paper, we introduce the elimination algorithm, which performs, in linear time, minimal model finding and minimal model checking for a significant subclass of positive CNF theories which we call  ...  A clause 5 is viewed as having a direction-from the negative to the positive literals-and this direction is made explicit in the way clauses are represented in logic programs.  ...  The EA solves model checking for the class of positive HCF theories in time O(n) , where n is the size of the theory. Proof.  ... 
doi:10.1016/s0004-3702(97)00060-x fatcat:6e42wb3wwrd5fkkczrxtkyq66u

Reasoning with minimal models: Efficient algorithms and applications [chapter]

Rachel Ben-Eliyahu, Luigi Palopoli
1994 Principles of Knowledge Representation and Reasoning  
In this paper, we introduce the elimination algorithm, which performs, in linear time, minimal model finding and minimal model checking for a significant subclass of positive CNF theories which we call  ...  A clause 5 is viewed as having a direction-from the negative to the positive literals-and this direction is made explicit in the way clauses are represented in logic programs.  ...  The EA solves model checking for the class of positive HCF theories in time O(n) , where n is the size of the theory. Proof.  ... 
doi:10.1016/b978-1-4832-1452-8.50101-9 fatcat:vnjxzu2e3vhdpedk57fw5hlln4

Equivalence is in the Eye of the Beholder [article]

Yuri Gurevich, James K. Huggins
1998 arXiv   pre-print
These contrasts can be made a little more dramatic.  ...  Proof. We check that ρ is indeed a run of R2. By the ordering lemma for R1, the moves of every agent of R2 are linearly ordered.  ... 
arXiv:cs/9810023v1 fatcat:4gbeekgrb5hzdlistjbrfsixfa

Reuse It Or Lose It: More Efficient Secure Computation Through Reuse of Encrypted Values [article]

Benjamin Mood, Debayan Gupta, Kevin Butler, Joan Feigenbaum
2015 arXiv   pre-print
Proof. Let us consider a case in Hybrid2 (A) (k, x; r) where for some value of i, A* sends the column value T i ⊕ ea for some ea = ea * such that the i th bit is b in ea * and b ⊕ 1 in ea .  ...  In Hybrid3 (A) (k, x; r), since the experiment observes the messages Q* , p* , and ea * ⊕p * , it can recover ea * and check Q* for consistency.  ... 
arXiv:1506.02954v1 fatcat:efd6g344dvgahgszec6ms3ophe

Page 820 of Mechanical Engineering Vol. 48, Issue 8 [page]

1926 Mechanical Engineering  
This made it possible to check results obtained by one method against those obtained by another method, for the same round, thus making AUG it ea prop expa any som giVil been Y) is b pres The this Dep  ...  PROGRAM OF EXPERIMENTAL WoRK ON 240-mmM. HowITzER The program for experiments on the 240-mm. howitzer was out- lined in 1921.  ... 

The Isabelle/Naproche Natural Language Proof Assistant [chapter]

Adrian De Lon, Peter Koepke, Anton Lorenzen, Adrian Marti, Marcel Schütz, Makarius Wenzel
2021 Lecture Notes in Computer Science  
"Image missing" is included in the current version of the Isabelle/PIDE which allows comfortable editing and asynchronous proof-checking of ForTheL texts.  ...  Abstract"Image missing" is an emerging natural proof assistant that accepts input in the controlled natural language ForTheL.  ...  mechanisms of SAD have been made more efficient and varied.  ... 
doi:10.1007/978-3-030-79876-5_36 fatcat:2ox6tmqltvelpppwkrpketx46m

Moat

Rohit Sinha, Sriram Rajamani, Sanjit Seshia, Kapil Vaswani
2015 Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security - CCS '15  
In this paper, we introduce a new approach to formally model these primitives and formally verify properties of so-called enclave programs that use them.  ...  relevant aspects of SGX, develop several adversary models, and present a sound verification methodology (based on automated theorem proving and information flow analysis) for proving that an enclave program  ...  The boolean variable ea denotes whether this access is made by enclave code to memenc.  ... 
doi:10.1145/2810103.2813608 dblp:conf/ccs/SinhaRSV15 fatcat:gypmcdgasbfopf6k4mpn7i55f4

Crowfoot: A Verifier for Higher-Order Store Programs [chapter]

Nathaniel Charlton, Ben Horsfall, Bernhard Reus
2012 Lecture Notes in Computer Science  
We present Crowfoot, an automatic verification tool for imperative programs that manipulate procedures dynamically at runtime; these programs use a heap that can store not only data but also code (commands  ...  argument t ::= x | c atomic statement At ::= x := eV | x := [eA] | [eA] := eV | [eA] := [eA] Fig. 2 . 2 Abstract syntax for program statements.  ...  Statement annotations In programs checked by Crowfoot, some of the statements need to be annotated with extra information to help the verifier.  ... 
doi:10.1007/978-3-642-27940-9_10 fatcat:om3himrfbbabraqvxmwticxn7e

Equivalence is in the eye of the beholder

Yuri Gurevich, James K. Huggins
1997 Theoretical Computer Science  
These contrasts can be made a little more dramatic.  ...  We skip the proof that R ea is faithful to R2. C ea : The O cial Column Evolving Algebra The evolving algebra C ea is shown in gure 10 below.  ... 
doi:10.1016/s0304-3975(96)00315-5 fatcat:pr4puf53p5g4porm7wisyang54

Page 52 of Engineering and Mining Journal Vol. 156, Issue 3 [page]

1955 Engineering and Mining Journal  
The special-composition, heat-treated bolts are vir- tually break-proof and last the long life of the plates.  ...  It’s a full-hour TV program presented every other week by United Stotes Steel. Consult your local newspaper for time and station.  ... 
« Previous Showing results 1 — 15 out of 15,127 results