A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Filters
Through Modeling to Synthesis of Security Automata
2007
Electronical Notes in Theoretical Computer Science
Preserved Fulltext
We define a set of process algebra operators, that we call controller operators, able to mimic the behavior of security automata introduced by Schneider in [17] and by Ligatti and al. in [3]. ...
Security automata are mechanisms for enforcing security policies that specify acceptable executions of programs. ...
Acknowledgement We thank the anonymous referees of STM06 for valuable comments that helped us to improve this paper. ...
doi:10.1016/j.entcs.2006.08.029
fatcat:ufqcd5vqsbgynmzly6fqgypomy
You Should Better Enforce Than Verify
[chapter]
2010
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
We then present previous theoretical models of runtime enforcement mechanisms and their expressive power with respect to enforcement. ...
of systems and to guarantee desired behaviors. ...
Pinchinat for their comments on an early version of this tutorial. ...
doi:10.1007/978-3-642-16612-9_9
fatcat:644w52hvwjdargcsoclapzpgvy
Advances and challenges of quantitative verification and synthesis for cyber-physical systems
2016
2016 Science of Security for Cyber-Physical Systems Workshop (SOSCYPS)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
This paper gives an overview of quantitative verification and synthesis techniques developed for cyber-physical systems, summarising recent achievements and future challenges in this important field. ...
Since they are increasingly often used in safety-or business-critical contexts, to mention invasive treatment or biometric authentication, there is an urgent need for modelling and verification technologies ...
Applications of probabilistic model checking using PRISM have spanned multiple fields, from wireless protocols and security analysis, through debugging DNA computing designs, to smart energy grids and ...
doi:10.1109/soscyps.2016.7579999
dblp:conf/cpsweek/Kwiatkowska16
fatcat:ugbkizf4xrcgzjvgtutecnepuu
Gate automata-driven run-time enforcement
2012
Computers and Mathematics with Applications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The goal of this paper is to present gate automata and to show a gate automata-driven strategy for the run-time enforcement in the S × C × T. ...
Gate automata have been proposed as a formalism for the specification of both security and trust policies in the scope of the Security-by-Contract-with-Trust (S×C×T) framework. ...
In [12] the authors present a method for modelling security automata through process algebra operators. ...
doi:10.1016/j.camwa.2011.08.046
fatcat:ejrjxd6jdjfgxbts46pnldnjka
Parametric Timed Model Checking for Guaranteeing Timed Opacity
[chapter]
2019
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Other Versions
We solve this problem in the setting of timed automata (TAs). ...
We first provide a general solution, and then extend the problem to parametric TAs, by synthesizing internal timings making the TA secure. ...
We thank Sudipta Chattopadhyay for helpful suggestions, Jiaying Li for his help with preliminary model conversion, and a reviewer for suggesting Remark 1. ...
doi:10.1007/978-3-030-31784-3_7
fatcat:v25khacdczavhpoqw47xwgtv7q
Trust-Driven Policy Enforcement through Gate Automata
2011
2011 Fifth International Conference on Innovative Mobile and Internet Services in Ubiquitous Computing
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2012; you can also visit the original URL.
The file type is application/pdf.
In this paper we introduce the notion of gate automata for describing security policies. This new kind of automata aim at defining a model for the specification of both security and trust policies. ...
The main novelty of our proposal is a unified framework for the integration of security enforcement and trust monitoring. ...
In [14] the authors present how security automata can be modelled through process algebra operators. ...
doi:10.1109/imis.2011.88
dblp:conf/imis/CostaM11
fatcat:s6nmo7o4dbblroaqta5uf6ssji
A framework for automatic generation of security controller
2010
Software testing, verification & reliability
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Moreover, we describe a tool for the synthesis of secure systems which is able to generate appropriate controller programs. ...
This paper concerns the study, the development and the synthesis of mechanisms for guaranteeing the security of complex systems, i.e., systems composed by several interacting components. ...
The information obtained through partial model checking can be used to enforce a security property. It is worth noting that the process Y = a.Y is a model of D. ...
doi:10.1002/stvr.441
fatcat:74glxk6ybrhozgh65digxhstvy
Programmable Cellular Automata Based Efficient Parallel AES Encryption Algorithm
2011
International journal of network security and its applications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
CA consists of two components 1) a set of cells and 2) a set of rules . Programmable Cellular Automata(PCA) employs some control signals on a Cellular Automata(CA) structure. ...
Programmable Cellular Automata were successfully applied for simulation of biological systems, physical systems and recently to design parallel and distributed algorithms for solving task density and synchronization ...
The desired CA model, evolved through an efficient implementation of genetic algorithm, is found to be at the edge of chaos. ...
doi:10.5121/ijnsa.2011.3615
fatcat:jjgcruvpqbafzfml4jiuhvdleq
A tool for domain-independent model mutation
2018
Science of Computer Programming
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
To improve this situation, we propose Wodel: a domain-specific language and tool for model-based mutation that is independent of the domain metamodel. ...
As an example, we illustrate the usage of Wodel for the mutation of security policies, and present an empirical evaluation of its expressiveness. ...
Acknowledgements Work partially funded by project FLEXOR (Spanish MINECO, TIN2014-52129-R), project DArDOS (Spanish MINECO/FEDER TIN2015-65845-C3-1-R) and the R&D programme of the Madrid Region (S2013/ ...
doi:10.1016/j.scico.2018.01.008
fatcat:mlrknmsdkbbjrijwdrid25774m
Embedded and Real-time Systems
[chapter]
2009
Real-Time Embedded Multithreading Using ThreadX
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2015; you can also visit the original URL.
The file type is application/pdf.
Verification models and techniques applied to testing and control of reactive systems RESEARCH CENTER Rennes -Bretagne-Atlantique THEME Embedded and Real Time Systems Project-Team VERTECS ...
Model-checking timed automata The model of timed automata, introduced by Alur and Dill in the 90's [22] is commonly used to represent real-time systems. ...
Introduction The VerTeCs team is focused on the use of formal methods to assess the reliability, safety and security of reactive software systems. ...
doi:10.1016/b978-1-85617-601-9.00001-2
fatcat:oo46lkp3gnbhbjc463pu7fs2hi
Embedded and Real-time Systems
[chapter]
2009
Real-Time Embedded Multithreading Using ThreadX and MIPS
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2015; you can also visit the original URL.
The file type is application/pdf.
Verification models and techniques applied to testing and control of reactive systems RESEARCH CENTER Rennes -Bretagne-Atlantique THEME Embedded and Real Time Systems Project-Team VERTECS ...
Model-checking timed automata The model of timed automata, introduced by Alur and Dill in the 90's [22] is commonly used to represent real-time systems. ...
Introduction The VerTeCs team is focused on the use of formal methods to assess the reliability, safety and security of reactive software systems. ...
doi:10.1016/b978-1-85617-631-6.00001-9
fatcat:sq7s43icwvgk7lro4lpmj46g4a
Active Automata Learning in Practice
[chapter]
2018
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
We predicted four major topics to be addressed in the then near future: efficiency, expressivity of models, bridging the semantic gap between formal languages and analyzed components, and solutions to ...
In this paper we review the progress that has been made over the past five years, assess the status of active automata learning techniques with respect to applications in the field of software engineering ...
Especially, in the past six years (2011 to 2016) active automata learning has found many applications, ranging from security analysis, to testing, to verification, and even synthesis. ...
doi:10.1007/978-3-319-96562-8_5
fatcat:jtpzftrzvzf3tdtbncntfc4s4q
Hierarchical Coordinated Control for Power System Voltage Using Linear Temporal Logic
2009
Engineering
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2015; you can also visit the original URL.
The file type is application/pdf.
In order to implement system voltage coordinated control, the LTL specification formula was transformed into hybrid Automata model by the proposed algorithms. ...
First, the hybrid Automata model for power system voltage control was given, and a hierarchical coordinated voltage control framework was described in detail. ...
The control behavior is similar to the OLTC controller, its automata model is as shown in
The Automata Model of Load Shedding Controller Load shedding is the final measure used to avoid a wide area ...
doi:10.4236/eng.2009.12014
fatcat:oakht6j6ffawpj2ps57rail5ji
Computational and Technological Models of Cognitive Monitoring Systems
2019
Advances in Science, Technology and Engineering Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
In the synthesis of models, it is proposed to reduce them to relatively finite operational automata. An example of a synthesized model of cognitive monitoring is given. ...
Based on the analysis of known solutions, the problem of automatic synthesis of computational models of cognitive monitoring is posed. ...
and problems with
synthesis
4 Automata
models
Enough good
speed of operation. ...
doi:10.25046/aj040226
fatcat:e2xnxk7ldbdkjcizwngugp3kke
Incremental Adaptive Attack Synthesis
[article]
2019
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
We use symbolic execution to extract path constraints, automata-based model counting to estimate probabilities of execution paths, and meta-heuristics to maximize information gain based on entropy in order ...
Our approach is incremental, reusing results from prior iterations in each attack step to improve the efficiency of attack synthesis. ...
Then, we discuss the use of automata-based model counting for computing the objective function. ...
arXiv:1905.05322v1
fatcat:ptjsehwawbbdpmuis2oluiat64
« Previous
Showing results 1 — 15 out of 2,916 results