Filters








577 Hits in 5.8 sec

Verification of Time-Aware Business Processes using Constrained Horn Clauses [article]

Emanuele De Angelis , Alberto Pettorossi DEC, University G. d'Annunzio, Pescara, Italy, DICII, University of Rome Tor Vergata, Rome, Italy,
2016 arXiv   pre-print
The definition of the operational semantics is given by a set OpSem of constrained Horn clauses (CHCs). Our verification method consists of two steps.  ...  We present a method for verifying properties of time-aware business processes, that is, business process where time constraints on the activities are explicitly taken into account.  ...  The CHC interpreter for the operational semantics of time-aware business processes.  ... 
arXiv:1608.02807v1 fatcat:yozyqcav3rfypku64eejqkuo54

Verifying Controllability of Time-Aware Business Processes [chapter]

Emanuele De Angelis, Fabio Fioravanti, Maria Chiara Meo, Alberto Pettorossi, Maurizio Proietti
2017 Lecture Notes in Computer Science  
We present an operational semantics for time-aware business processes, that is, processes modeling the execution of business activities, whose durations are subject to linear constraints over the integers  ...  Controllability properties are encoded by quantified reachability formulas, where the reachability predicate is recursively defined by a set of Constrained Horn Clauses (CHCs).  ...  (Here we will use the 'Constrained Horn Clauses' term, which is more common in the area of verification.)  ... 
doi:10.1007/978-3-319-61252-2_8 fatcat:6xbhfj3cynd5nmqadunqb75qju

An Open Platform for Business Process Modeling and Verification [chapter]

Antonio De Nicola, Michele Missikoff, Maurizio Proietti, Fabrizio Smith
2010 Lecture Notes in Computer Science  
BPAL relies on a formalism, Horn clause logic, that is particularly well-suited for its use within a wider knowledge representation framework (for instance in conjunction with rule based ontology languages  ...  The rest of this paper is organized as follows. In Section 2 some relevant related works are presented. The BPAL language for business process modeling and verification is described in Section 3.  ...  composition rules (in the form of Horn clauses).  ... 
doi:10.1007/978-3-642-15364-8_6 fatcat:kbvkyxzjkzbrldajseliiobrea

Analysis and Transformation of Constrained Horn Clauses for Program Verification [article]

Emanuele De Angelis
2021 arXiv   pre-print
We present specialisation-based techniques for translating verification problems for different programming languages, and in general software systems, into satisfiability problems for constrained Horn  ...  clauses (CHCs), a term that has become popular in the verification field to refer to CLP programs.  ...  Emanuele De Angelis, Fabio Fioravanti, Alberto Pettorossi, and Maurizio Proietti are members of the INdAM Research Group GNCS.  ... 
arXiv:2108.00739v1 fatcat:gevl2xlor5hrzentqc77irt6gu

Analysis and Transformation of Constrained Horn Clauses for Program Verification

EMANUELE DE ANGELIS, FABIO FIORAVANTI, JOHN P. GALLAGHER, MANUEL V. HERMENEGILDO, ALBERTO PETTOROSSI, MAURIZIO PROIETTI
2021 Theory and Practice of Logic Programming  
We present specialization-based techniques for translating verification problems for different programming languages, and in general software systems, into satisfiability problems for constrained Horn  ...  clauses (CHCs), a term that has become popular in the verification field to refer to CLP programs.  ...  Emanuele De Angelis, Fabio Fioravanti, Alberto Pettorossi, and Maurizio Proietti are members of the INdAM Research Group GNCS.  ... 
doi:10.1017/s1471068421000211 fatcat:zfzmqjuozzd5dlfgog7kfmxhce

Beyond soundness: on the verification of semantic business process models

Ingo Weber, Jörg Hoffmann, Jan Mendling
2010 Distributed and parallel databases  
The verification of control-flow soundness is well understood as an important step before deploying business process models.  ...  We examine the borderline between classes of processes that can, or cannot, be verified in polynomial time.  ...  Further, we want to acknowledge the contributions of Ulrich Benz during the early beginnings of this work.  ... 
doi:10.1007/s10619-010-7060-9 fatcat:goygpmafvfg3tetos3s5hn62mi

AppLP: A Dialogue on Applications of Logic Programming [article]

David S. Warren, Yanhong A. Liu
2017 arXiv   pre-print
This document describes the contributions of the 2016 Applications of Logic Programming Workshop (AppLP), which was held on October 17 and associated with the International Conference on Logic Programming  ...  Horn clause solving is useful because networks can be expressed as Datalog programs using constrained Horn clauses, in which packets are represented as differences of cubes.  ...  Horn Clause Solvers for Network Verification Nikolaj Bjørner, Nuno P.  ... 
arXiv:1704.02375v1 fatcat:eai5tuldkvez3makttxz23goby

Smart test data generators via logic programming

Lukas Bulwahn, Marc Herbstritt
2011 International Conference on Logic Programming  
These test data generators are applied to find errors in specifications, as we show in a case study of a hotel key card system. ACM Subject Classification D.2.5 Testing and Debugging  ...  Acknowledgements I would like to thank Andrei Popescua, Sascha Boehme, Tobias Nipkow, Alexander Krauss and the anonymous referees for comments on earlier versions of this paper.  ...  In the process of creating Horn clauses, it is necessary to introduce new predicates for sub formulas, as our Horn clauses do not allow disjunctions within the premises and nested expressions under negations  ... 
doi:10.4230/lipics.iclp.2011.139 dblp:conf/iclp/Bulwahn11 fatcat:g7l7fs27rfamtgfn56krfwz42m

Behavioral Reasoning on Semantic Business Processes in a Rule-Based Framework [chapter]

Fabrizio Smith, Maurizio Proietti
2014 Communications in Computer and Information Science  
First, we define a rule-based procedural semantics for a relevant fragment of BPMN, a very popular graphical notation for specifying business processes.  ...  Our semantics defines a state transition system by following an approach similar to the Fluent Calculus, and allows us to specify state change in terms of preconditions and effects of the enactment of  ...  , i.e., binary Horn clauses.  ... 
doi:10.1007/978-3-662-44440-5_18 fatcat:iwtgmmap4bfmxo3yl5tfzpbajy

Multi-agent Coordination as Distributed Logic Programming [chapter]

David Robertson
2004 Lecture Notes in Computer Science  
A set of such behavioural clauses specifies the message passing behaviour expected of a social norm. We refer to this as the interaction framework. Its syntax is as shown in Figure 1 .  ...  One view of multi-agent system design is that coordination is achieved via an interaction model in which participating agents assume roles constrained by the social norms of their shared task; the state  ...  The essence of LCC is its mixture of process calculus and Horn clauses.  ... 
doi:10.1007/978-3-540-27775-0_29 fatcat:hxvg5efayzbgfeedp67m24ju6u

Monitoring business constraints with the event calculus

Marco Montali, Fabrizio M. Maggi, Federico Chesani, Paola Mello, Wil M. P. van der Aalst
2013 ACM Transactions on Intelligent Systems and Technology  
In mobucon, business constraints are defined using ConDec, a declarative process modelling language.  ...  Today, large business processes are composed of smaller, autonomous, interconnected sub-systems, achieving modularity and robustness.  ...  Since the majority of EC-based approaches rely on the Horn clause fragment of first-order logic with negation as failure [6] , we will use Prolog as the specification language.  ... 
doi:10.1145/2542182.2542199 fatcat:aqdv7ywypfamnphwdxmlohbnfe

Web Services Verification and Prudent Implementation [chapter]

Tigran Avanesov, Yannick Chevalier, Mohammed Anis Mekki, Michaël Rusinowitch
2012 Lecture Notes in Computer Science  
We present a tool that compiles an Alice&Bob description of a Web Services choreography into a set of servlets.  ...  Alice&Bob notation is widely used to describe conversations between partners in security protocols.  ...  Most notably, ASLan extends IF with support of Horn clauses and LTL formulas. For instance invariants of the system can be defined by a set of (definite) Horn clauses.  ... 
doi:10.1007/978-3-642-28879-1_12 fatcat:inz4kv6vebdibiyyj6imdvljoi

A Survey of Smart Contract Formal Specification and Verification [article]

Palina Tolmach, Yi Li, Shang-Wei Lin, Yang Liu, Zengxiang Li
2021 arXiv   pre-print
Given the significance of smart contracts in supporting important activities across industry sectors including supply chain, finance, legal and medical services, there is a strong demand for verification  ...  We also discuss the current approaches used in verifying such property specifications and identify gaps with the hope to recognize promising directions for future work.  ...  While single-entrancy is verified statically using Horn clauses in [182] , a similar property is also defined in terms of instructions in the execution trace [134] (Fig. 8) .  ... 
arXiv:2008.02712v3 fatcat:ltkckg4eivdhtppaebnlis3tci

Security of Blockchain-Based Supply Chain Management Systems: Challenges and Opportunities

Sana Al-Farsi, Muhammad Mazhar Rathore, Spiros Bakiras
2021 Applied Sciences  
Although, the primary motive of using a blockchain for supply chain management is to reduce the overall production cost while providing the comprehensive security to the system.  ...  Blockchain is a revolutionary technology that is being used in many applications, including supply chain management.  ...  Conflicts of Interest: The authors declare no conflict of interest.  ... 
doi:10.3390/app11125585 fatcat:w4r6rh3uifghdbhueditwdp5sq

HFContractFuzzer: Fuzzing Hyperledger Fabric Smart Contracts for Vulnerability Detection [article]

Mengjie Ding, Peiru Li, Shanshan Li, He Zhang
2021 arXiv   pre-print
We use HFContractFuzzer to detect vulnerabilities in five contracts from typical sources and discover that four of them have security vulnerabilities, proving the effectiveness of the proposed method.  ...  With its unique advantages such as decentralization and immutability, blockchain technology has been widely used in various fields in recent years.  ...  ZEUS leverages abstract interpretation and symbolic model checking, as well as the ability to constrain horn clauses to quickly verify secure contracts.  ... 
arXiv:2106.11210v1 fatcat:n4vxcivbdzhoxoyok4ruakkryu
« Previous Showing results 1 — 15 out of 577 results