Results 11 to 20 of about 481 (199)
Loop Invariants Elimination for Definite Iterations over Unchangeable Data Structures in C Programs
Моделирование и анализ информационных систем, 2015 The C-program verification is an urgent problem of modern programming. To apply known methods of deductive verification it is necessary to provide loop invariants which might be a challenge in many cases.
I. V. Maryasov, V. A. Nepomniaschy
doaj +1 more source
Representing 3/2-Institutions as Stratified Institutions
Mathematics, 2022 On the one hand, the extension of ordinary institution theory, known as the theory of stratified institutions, is a general axiomatic approach to model theories where the satisfaction is parameterized by states of the models.
Răzvan Diaconescu
doaj +1 more source
A Heuristic-Primed Decision-Making Model under the Assumption of Bounded Resources
Computer Sciences & Mathematics Forum, 2023 Existing decision-making models are generally based on the classical normative paradigm, which seldom considers the limited cognitive and environmental resources of humans when making decisions in real environments.
Nady Slam, Xiang Li, Bojie Feng
doaj +1 more source
Structured Axiomatic Semantics for UML Models [PDF]
Electronic Workshops in Computing, 2000 In this paper we provide a systematic formal interpretation for most elements of the UML notation. This interpretation, in a structured temporal logic, enables precise analysis of the properties of these models, and the verification of one model against another.
Kevin Lano, Juan Bicarregui, Andy Evans
openaire +2 more sources
The Axiomatic Approach to Non-Classical Model Theory
Mathematics, 2022 Institution theory represents the fully axiomatic approach to model theory in which all components of logical systems are treated fully abstractly by reliance on category theory. Here, we survey some developments over the last decade or so concerning the
Răzvan Diaconescu
doaj +1 more source
A Structural Characterization of Extended Correctness-Completeness in Classical Logic
Crítica, 2019 In this paper I deal with first order logic and axiomatic systems. I present the metalogical results that show the property of satisfying Modus Ponens as a necessary and sufficient condition for the extended completeness of the system, and to the ...
José Alfredo Amor
doaj +1 more source
DisBlue+: A distributed annotation-based C# compiler
Egyptian Informatics Journal, 2010 Many programming languages utilize annotations to add useful information to the program but they still result in more tokens to be compiled and hence slower compilation time.
Samir E. AbdelRahman, Amr M. AbdelLatif
doaj +1 more source
Deductive Verification of Telecommunication Systems Written in C
Моделирование и анализ информационных систем, 2015 A deductive approach to verification of telecommunication systems written in C is proposed. The approach is based on the extension of C by declarative statements and on reduction of verification of parallel communicating components of these systems to ...
I. S. Anureev
doaj +1 more source
Logic, Game Theory, and Social Choice: What Do They Have in Common?
Axioms, 2022 The answer to the question above is that in all these domains axiomatic characterizations are given of, respectively, mathematical reasoning, certain notions from game theory, and certain social choice rules.
Harrie de Swart
doaj +1 more source
An axiomatic semantics for the synchronous language Gentzen [PDF]
Journal of Computer and System Sciences, 2001 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +5 more sources