Results 1  10
of
1,444
Utilizing Formal Assertions for System Design of Network
 Processors,” Proc. Design, Automation and Test in Europe Conf. and Exhibition Designers’ Forum (DATE 04), IEEE CS
, 2004
"... System level modeling with executable languages such as C/C++ has been crucial in the development of large electronic systems from general processors to application specific designs. To make sure that the executable models behave as they should, the designers often have to “eyeball ” the simulation ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
ball ” the simulation traces and at best, apply simple “assert ” statements or write simple trace checkers in some scripting languages. The problem is the lack of a concise and formal method to specify and check desired properties, whether they be functional or performance in nature. In this paper, we apply assertion
Integration of Formal Assertions with Bounded Exhaustive Testing for Critical Systems
"... Abstract — It is wellknown that testing is only a partial proof of a program’s correctness. One way to bolster testing is to add assertions as runtime checks to validate the execution of a system. Combining assertions with testing is compelling because the tester need not determine the correct outp ..."
Abstract
 Add to MetaCart
approach in which assertions are derived from a formal specification, and the resulting selfchecking program is subjected to a bounded exhaustive set of test inputs. Because they are derived from a specification, the assertions are more substantial. Exhaustively testing a subset of the inputs reveals
On the Effectiveness of Theorem Proving Guided Discovery of Formal Assertions for a Register Allocator in a HighLevel Synthesis System
 Proceedings of 11th Conference on Theorem Proving in Higher Or der Logics (TPHOL'98
"... . This paper presents a formal specification and a proof of correctness for the register optimization task in highlevel synthesis. A widely implemented register optimization algorithm is modeled in higherorder logic and verified in a theorem prover environment. A rich collection of correctness ..."
Abstract

Cited by 3 (3 self)
 Add to MetaCart
of correctness properties is systematically formulated during the theorem proving exercise. These properties constitute a detailed set of formal assertions that are identified with the invariants at various stages of the algorithm. The formal assertions are then embedded as programming assertions
Notes On Formalizing Context
, 1993
"... These notes discuss formalizing contexts as first class objects. The basic relation is ist(c; p). It asserts that the proposition p is true in the context c. The most important formulas relate the propositions true in different contexts. Introducing contexts as formal objects will permit axiomatizat ..."
Abstract

Cited by 417 (9 self)
 Add to MetaCart
These notes discuss formalizing contexts as first class objects. The basic relation is ist(c; p). It asserts that the proposition p is true in the context c. The most important formulas relate the propositions true in different contexts. Introducing contexts as formal objects will permit
Analog Simulation Meets Digital Verification  A Formal Assertion Approach for MixedSignal Verification
 SASIMI
, 2007
"... Abstract — Functional and formal verification are important methodologies for complex mixedsignal designs. But there exist a verification gap between the analog and digital blocks of a mixedsignal system. Our approach improves the verification process by creating mixedsignal assertions which is ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
Abstract — Functional and formal verification are important methodologies for complex mixedsignal designs. But there exist a verification gap between the analog and digital blocks of a mixedsignal system. Our approach improves the verification process by creating mixedsignal assertions which
Proving the correctness of multiprocess programs.
 IEEE Transactions on Software Engineering,
, 1977
"... AbstractThe inductive assertion method is generalized to permit formal, machineverifiable proofs of correctness for multiprocess programs. Individual processes are represented by ordinary flowcharts, and no special synchronization mechanisms are assumed, so the method can be applied to a large cl ..."
Abstract

Cited by 391 (17 self)
 Add to MetaCart
AbstractThe inductive assertion method is generalized to permit formal, machineverifiable proofs of correctness for multiprocess programs. Individual processes are represented by ordinary flowcharts, and no special synchronization mechanisms are assumed, so the method can be applied to a large
Model Checking Java Programs Using Java PathFinder
, 1998
"... . This paper describes a translator called Java PathFinder (Jpf), from Java to Promela, the modeling language of the Spin model checker. Jpf translates a given Java program into a Promela model, which then can be model checked using Spin. The Java program may contain assertions, which are translated ..."
Abstract

Cited by 386 (32 self)
 Add to MetaCart
. This paper describes a translator called Java PathFinder (Jpf), from Java to Promela, the modeling language of the Spin model checker. Jpf translates a given Java program into a Promela model, which then can be model checked using Spin. The Java program may contain assertions, which
A practical approach to programming with assertions
 IEEE Transactions on Software Engineering
, 1995
"... Abstract Embedded assertions have been recognized as a potentially powerful tool for automatic runtime detection of software faults during debugging, testing, maintenance and even production versions of software systems. Yet despite the richness of the notations and the maturity of the techniques a ..."
Abstract

Cited by 165 (2 self)
 Add to MetaCart
in developing a method of programming with assertions. Index TermsAnna, APP, assertions, C, consistency checking, formal specifications, formal methods, programming environ
Local Reasoning about Programs that Alter Data Structures
, 2001
"... We describe an extension of Hoare's logic for reasoning about programs that alter data structures. We consider a lowlevel storage model based on a heap with associated lookup, update, allocation and deallocation operations, and unrestricted address arithmetic. The assertion language is ba ..."
Abstract

Cited by 324 (28 self)
 Add to MetaCart
We describe an extension of Hoare's logic for reasoning about programs that alter data structures. We consider a lowlevel storage model based on a heap with associated lookup, update, allocation and deallocation operations, and unrestricted address arithmetic. The assertion language
Assertability Constraints and Absurd Assertions∗
, 2007
"... Intuitions about truthconditions often break down. When they do, the question inevitably arises: is the breakdown due to semantics, or pragmatics? Absurd assertions, those that sound weird, and whose truthvalues are often difficult to judge, act as stress tests for theories of linguistic interpret ..."
Abstract
 Add to MetaCart
and developed formal pragmatic principles to deal with the puzzles. The general point is that, any time we are faced with such stress tests, we are faced with a difficult decision problem: where do we locate the source of the difficulty? In this paper I will examine a handful of absurd assertions, hoping
Results 1  10
of
1,444