Requirements interaction management
WN Robinson, SD Pawlowski, V Volkov - ACM Computing Surveys …, 2003 - dl.acm.org
Requirements interaction management (RIM) is the set of activities directed toward the
discovery, management, and disposition of critical relationships among sets of requirements …
discovery, management, and disposition of critical relationships among sets of requirements …
A survey of safety and trustworthiness of large language models through the lens of verification and validation
Large language models (LLMs) have exploded a new heatwave of AI for their ability to
engage end-users in human-level conversations with detailed and articulate answers across …
engage end-users in human-level conversations with detailed and articulate answers across …
[HTML][HTML] An overview of SAL
S Bensalem, V Ganesh, Y Lakhnech… - NASA …, 2000 - books.google.com
To become practical for assurance, automated formal methods must be made more
scalable, automatic, and cost-effective. Such an increase in scope, scale, automation, and …
scalable, automatic, and cost-effective. Such an increase in scope, scale, automation, and …
Dynamically discovering likely program invariants to support program evolution
MD Ernst, J Cockrell, WG Griswold… - Proceedings of the 21st …, 1999 - dl.acm.org
Explicitly stated program invariants can help programmers by identifying program properties
that must be preserved when modifying code. In practice, however, these invariants are …
that must be preserved when modifying code. In practice, however, these invariants are …
Construction of abstract state graphs with PVS
In this paper, we propose a method for the automatic construction of an abstract state graph
of an arbitrary system using the Pvs theorem prover. Given a parallel composition of …
of an arbitrary system using the Pvs theorem prover. Given a parallel composition of …
PR-Miner: automatically extracting implicit programming rules and detecting violations in large software code
Z Li, Y Zhou - ACM SIGSOFT Software Engineering Notes, 2005 - dl.acm.org
Programs usually follow many implicit programming rules, most of which are too tedious to
be documented by programmers. When these rules are violated by programmers who are …
be documented by programmers. When these rules are violated by programmers who are …
Formal specification: a roadmap
A Lamsweerde - Proceedings of the Conference on the Future of …, 2000 - dl.acm.org
Formal specifications have been a focus of software engineering research for many years
and have been applied in a wide variety of settings. Their industrial use is still limited but has …
and have been applied in a wide variety of settings. Their industrial use is still limited but has …
Non-linear loop invariant generation using Gröbner bases
S Sankaranarayanan, HB Sipma, Z Manna - Proceedings of the 31st …, 2004 - dl.acm.org
We present a new technique for the generation of non-linear (algebraic) invariants of a
program. Our technique uses the theory of ideals over polynomial rings to reduce the non …
program. Our technique uses the theory of ideals over polynomial rings to reduce the non …
Predicate abstraction for software verification
C Flanagan, S Qadeer - Proceedings of the 29th ACM SIGPLAN …, 2002 - dl.acm.org
Software verification is an important and difficult problem. Many static checking techniques
for software require annotations from the programmer in the form of method specifications …
for software require annotations from the programmer in the form of method specifications …
Synthesis of linear ranking functions
MA Colóon, HB Sipma - International Conference on Tools and Algorithms …, 2001 - Springer
Deductive verification of progress properties relies on finding ranking functions to prove
termination of program cycles. We present an algorithm to synthesize linear ranking …
termination of program cycles. We present an algorithm to synthesize linear ranking …