Integrating deduction and model finding in a language independent setting

Software artifacts are ubiquitous in our lives being an essential part of home appliances, cars, cel phones, and even in more critical activities like aeronautics and health sciences. In this context software failures may produce enormous losses, either economical or, in the extreme, in human lives. Software analysis is an area in software engineering concerned on the application of different techniques in order to prove the (relative) absence of errors in software artifacts. In many cases these methods of analysis are applied by following certain methodological directives that ensure better results. In a previous work we presented the notion of satisfiability calculus as a model theoretical counterpart of Meseguer's proof calculus, providing a formal foundation for a variety of tools that are based on model construction. The present work shows how effective satisfiability sub-calculi, a special type of satisfiability calculi, can be combined with proof calculi, in order to provide foundations to certain methodological approaches to software analysis by relating the construction of finite counterexamples and the absence of proofs, in an abstract categorical setting.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/23/2023

ReLo: a Dynamic Logic to Reason About Reo Circuits

Critical systems require high reliability and are present in many domain...
research
01/24/2023

Improving Software Engineering in Biostatistics: Challenges and Opportunities

Programming is ubiquitous in applied biostatistics; adopting software en...
research
02/08/2020

SAT-Based ATL Satisfiability Checking

Synthesis of models and strategies is a very important problem in softwa...
research
02/28/2020

Teaching a Formalized Logical Calculus

Classical first-order logic is in many ways central to work in mathemati...
research
04/27/2021

Finding Good Proofs for Description Logic Entailments Using Recursive Quality Measures (Extended Technical Report)

Logic-based approaches to AI have the advantage that their behavior can ...
research
03/03/2023

ADCL: Acceleration Driven Clause Learning for Constrained Horn Clauses

Constrained Horn Clauses (CHCs) are often used in automated program veri...
research
08/30/2021

Satisfiability and Containment of Recursive SHACL

The Shapes Constraint Language (SHACL) is the recent W3C recommendation ...

Please sign up or login with your details

Forgot password? Click here to reset