Filters








64,764 Hits in 3.5 sec

Monitoring refinement via symbolic reasoning

Michael Emmi, Constantin Enea, Jad Hamza
2015 SIGPLAN notices  
Our algorithms are founded on incremental, symbolic reasoning, and exploit foundational insights into the refinement-checking problem.  ...  We develop scalable and effective algorithms for detecting refinement violations.  ...  Refinement via Symbolic Reasoning In this section we represent the kernels of typical concurrent objects, including atomic collections and locks, in a simple first-order language.  ... 
doi:10.1145/2813885.2737983 fatcat:mid2kiysl5fv3e53zyj764n2yu

Monitoring refinement via symbolic reasoning

Michael Emmi, Constantin Enea, Jad Hamza
2015 Proceedings of the 36th ACM SIGPLAN Conference on Programming Language Design and Implementation - PLDI 2015  
Our algorithms are founded on incremental, symbolic reasoning, and exploit foundational insights into the refinement-checking problem.  ...  We develop scalable and effective algorithms for detecting refinement violations.  ...  Refinement via Symbolic Reasoning In this section we represent the kernels of typical concurrent objects, including atomic collections and locks, in a simple first-order language.  ... 
doi:10.1145/2737924.2737983 dblp:conf/pldi/EmmiEH15 fatcat:2hwuy2glyja5fokmae7xdpoify

Symbolic Verification of Cache Side-channel Freedom [article]

Sudipta Chattopadhyay, Abhik Roychoudhury
2018 arXiv   pre-print
The power of such a framework is to allow symbolic reasoning over counterexample traces and to combine it with runtime monitoring for eliminating cache side channels during program execution.  ...  At the core of our framework is a novel symbolic verification technique based on automated abstraction refinement of cache semantics.  ...  Secondly, the core symbolic engine of CACHEFIX systematically combines its reasoning power with runtime monitoring to ensure cache side-channel freedom during program execution.  ... 
arXiv:1807.04701v1 fatcat:cjukpybayvdcbpbf5wzypbck5y

Micro-Policies: Formally Verified, Tag-Based Security Monitors

Arthur Azevedo de Amorim, Maxime Denes, Nick Giannarakis, Catalin Hritcu, Benjamin C. Pierce, Antal Spector-Zabusky, Andrew Tolmach
2015 2015 IEEE Symposium on Security and Privacy  
, and monitor services) for P Monitor code (transfer function and monitor services) for P refines refines Generic components Micro-policy-specific components Generic miss handler abstract symbolic concrete  ...  We propose a methodology for defining and reasoning about such tag-based reference monitors in terms of a high-level "symbolic machine," and we use this methodology to define and formally verify micro-policies  ...  A noninterference property is established at the abstract machine level and transferred to the other levels via two steps of refinement.  ... 
doi:10.1109/sp.2015.55 dblp:conf/sp/AmorimDGHPST15 fatcat:h3c43yx4ofblzhmkl7d64h2h5q

Specifying and analyzing security automata using CSP-OZ

David Basin, Ernst-Ruediger Olderog, Paul E. Sevinc
2007 Proceedings of the 2nd ACM symposium on Information, computer and communications security - ASIACCS '07  
We provide theoretical results relating CSP-OZ specifications and security automata and show how refinement can be used to reason about specifications of security automata and their combination with target  ...  Security automata are a variant of Büchi automata used to specify security policies that can be enforced by monitoring system execution.  ...  . • Notions and laws of refinement, which enable correct proofs and system transformation. • Tool support for reasoning about specifications.  ... 
doi:10.1145/1229285.1229299 dblp:conf/ccs/BasinOS07 fatcat:byvzbb3zb5bipbskwthba2qbsu

Soft contract verification for higher-order stateful programs

Phúc C. Nguyễn, Thomas Gilray, Sam Tobin-Hochstadt, David Van Horn
2017 Proceedings of the ACM on Programming Languages  
However, since they are enforced at runtime, monitoring contracts imposes significant overhead and delays error discovery.  ...  In this paper, we present and evaluate our solution based on higher-order symbolic execution, explain the techniques we used to address such thorny issues, formalize a notion of behavioral approximation  ...  Verification of f via symbolic execution begins by applying f to a fresh symbolic value for its argument.  ... 
doi:10.1145/3158139 dblp:journals/pacmpl/NguyenGTH18 fatcat:5p4w5rjhxrdgfhgkphzmqt23jq

Application of Time Series Data Anomaly Detection Based on Deep Learning in Continuous Casting Process

Yujie ZHOU, Ke XU, Fei HE, Zhiyan ZHANG
2022 ISIJ International  
The reason for False Positives may be that inclusions formed in the ironmaking and steelmaking processes, so inclusions cannot be detected via continuous casting process data.  ...  inclusions is not interfered by the refining process.  ... 
doi:10.2355/isijinternational.isijint-2021-372 fatcat:ujgcdf77kzeq5cw4ttldbk6kw4

On Implementing Symbolic Controllability

Jasmine Xuereb, Adrian Francalanza
2020 Zenodo  
One property that is expected of monitors is consistent verdict detections; this property was characterised in prior work via a symbolic analysis called symbolic controllability.  ...  This paper explores whether the proposed symbolic analysis lends itself well to the construction of a tool that checks monitors for this deterministic behaviour.  ...  Further afield, the work in [31] uses symbolic analysis and SMT solvers to reason about the runtime monitoring of contracts.  ... 
doi:10.5281/zenodo.3966954 fatcat:yykdm72fizf3td4tp3v3qpsauq

Soft contract verification

Phúc C. Nguyen, Sam Tobin-Hochstadt, David Van Horn
2014 Proceedings of the 19th ACM SIGPLAN international conference on Functional programming - ICFP '14  
Our approach uses higher-order symbolic execution, leveraging contracts as a source of symbolic values including unknown behavioral values, and employs an updatable heap of contract invariants to reason  ...  However, run-time monitoring and enforcement of contracts imposes significant overhead and delays discovery of faulty components to run-time.  ...  We systematize this kind of reasoning by augmenting a standard reduction semantics for contracts with symbolic values that are refined by sets of contracts.  ... 
doi:10.1145/2628136.2628156 dblp:conf/icfp/NguyenTH14 fatcat:qxbbe2ehijdmjkuisx7fxux4ua

On Implementing Symbolic Controllability [chapter]

Adrian Francalanza, Jasmine Xuereb
2020 Lecture Notes in Computer Science  
One property that is expected of monitors is consistent verdict detections; this property was characterised in prior work via a symbolic analysis called symbolic controllability.  ...  This paper explores whether the proposed symbolic analysis lends itself well to the construction of a tool that checks monitors for this deterministic behaviour.  ...  Further afield, the work in [31] uses symbolic analysis and SMT solvers to reason about the runtime monitoring of contracts.  ... 
doi:10.1007/978-3-030-50029-0_22 fatcat:njybuad53ncebeqefemxd7kdle

Scade2Nu : A Tool for Verifying Safety Requirements of SCADE Models with Temporal Specifications

Jian Shi, Jianqi Shi, Yanhong Huang, Jiawen Xiong, Qing She
2019 Requirements Engineering: Foundation for Software Quality  
MODULE In the left of Fig. 2 shows the SCADE variable monitor mechanism after we refine the monitor parameters.  ...  In STP-approach, the monitor-like mechanism means for every event or condition variable var there is a monitor module Set_Var which is a solo module to manipulate the variable var via monitor parameters  ... 
dblp:conf/refsq/ShiSHXS19 fatcat:yos3r3nqpraf5kdfhfeynf4i3e

Flexible Design and Implementation of Cognitive Models for Predicting Pilot Errors in Cockpit Design [chapter]

Jurriaan van Diggelen, Joris Janssen, Tina Mioch, Mark Neerincx
2011 Human Modelling in Assisted Transportation  
Tasks that involve sign-symbol translations or involve other kind of deductive reasoning are passed to the KMM.  ...  In our framework, this knowledge enters the cognitive layer via the associative layer.  ... 
doi:10.1007/978-88-470-1821-1_15 fatcat:3yobz5iq6zc7jeellg6wr57i3u

Abstraction Based Automated Test Generation from Formal Tabular Requirements Specifications [chapter]

Renzo Degiovanni, Pablo Ponzio, Nazareno Aguirre, Marcelo Frias
2011 Lecture Notes in Computer Science  
The technique is based on counterexample guided abstraction refinement and the use of SMT solving.  ...  Moreover, in order to effectively perform automated test generation, we take advantage of particular characteristics of tabular requirements descriptions to aid the abstraction and abstraction refinement  ...  The lazy predicate abstraction algorithm is a symbolic forward search algorithm with the capability of refining the abstract regions as needed.  ... 
doi:10.1007/978-3-642-21768-5_8 fatcat:xxonfue54ncqznqkte5elcme6m

A Framework for Developing Cyber Physical Systems

Xudong He, Zhijiang Dong, Heng Yin, Yujian Fu
2017 Proceedings of the 29th International Conference on Software Engineering and Knowledge Engineering  
To ensure symbolic execution terminates within a reasonable time frame, we limit the number of loop iterations, by using JPF Verify API.  ...  At the implementation level, safety properties can be checked through bounded symbolic model checking and monitoring the actual behavior of hardware devices.  ... 
doi:10.18293/seke2017-095 dblp:conf/seke/HeDYF17 fatcat:wgtqept25fevzm7gf7bddop37e

NANE: Identifying Misuse Cases Using Temporal Norm Enactments

Ozgur Kafali, Munindar P. Singh, Laurie Williams
2016 2016 IEEE 24th International Requirements Engineering Conference (RE)  
We demonstrate how NANE enables monitoring of potential misuses on a healthcare scenario.  ...  Our research goal is to help analysts identify misuse cases by formal reasoning about norm enactments.  ...  MONITORING MISUSE WITH NANE We now describe how NANE enables monitoring of potential misuses via temporal reasoning.  ... 
doi:10.1109/re.2016.34 dblp:conf/re/KafaliSW16 fatcat:hncy4uid5vf4npmuq5qd6ngt4y
« Previous Showing results 1 — 15 out of 64,764 results