Poster: Modeling of APT Attacks through Transforming Attack Scenarios into DEVS Models Jiyeon Kim Hyung-Jong Kim

Source URL: www.ieee-security.org

• Computer science
• Applied mathematics
• Simulation
• Dev
• Advanced persistent threat
• Cyberwarfare
• Computer security
• SP-DEVS
• Finite & Deterministic Discrete Event System Specification
• Automata theory
• DEVS
• Security

An extended abstract of this paper is published in the proceedings of the 40th International Colloquium on Automata, Languages and Programming—ICALPThis is the full version. Outsourced Pattern Matching Sebastian

Source URL: www.eng.biu.ac.il

• Transmission Control Protocol
• NP
• Commitment scheme
• Large cardinals
• Mathematics
• Cryptography
• Applied mathematics
• IP

On the Satisfiability of Two-Variable Logic over Data Words Claire David, Leonid Libkin, and Tony Tan School of Informatics, University of Edinburgh Abstract. Data trees and data words have been studied extensively

Source URL: alpha.uhasselt.be

• Theoretical computer science
• Model theory
• Automata theory
• Regular language
• Presburger arithmetic
• Structure
• Decision problem
• Mathematics
• Mathematical logic
• Formal languages

CV Filip Murlak Contact data address University of Warsaw, Faculty of Mathematics, Informatics, and Mechanics

Source URL: www.mimuw.edu.pl

• Computer science
• International Colloquium on Automata
• Languages and Programming
• Symposium on Theoretical Aspects of Computer Science
• Tree automaton
• Finite-state machine
• Formal language
• Hierarchy
• Automata theory
• Theoretical computer science
• Applied mathematics

How to Efficiently Translate Extensions of Temporal Logics into Alternating Automata C´esar S´ anchez1,2 and Julian Samborski-Forlese1 1

Source URL: software.imdea.org

• Computer science
• Ω-automaton
• Deterministic finite automaton
• Nondeterministic finite automaton
• Linear temporal logic
• Finite-state machine
• Symbol
• Büchi automaton
• Automata theory
• Theoretical computer science
• Formal methods

1 Graph Reachability and Pebble Automata over Infinite Alphabets Tony Tan Hasselt University and Transnational University of Limburg Let D denote an infinite alphabet – a set that consists of infinitely many symbols.

Source URL: alpha.uhasselt.be

•i. I PROBABILISTIC LOGICS AND THE SYNTHESIS OF RELIABLE ORGANISMS FROM UNRELIABlE COMPONENTS

Source URL: arep.med.harvard.edu

• Logic
• Propositional calculus
• Automaton
• Quantum dot cellular automaton
• Automata theory
• Theory of computation
• Mathematical logic

Path Logics for Querying Graphs: Combining Expressiveness and Efficiency Diego Figueira Leonid Libkin

Source URL: homepages.inf.ed.ac.uk

• Mathematics
• Applied mathematics
• FO
• Computational complexity theory
• Regular language
• Valuation
• Automata theory
• Formal languages
• Theoretical computer science

Automata and Logics for Concurrent Systems: Realizability and Verification Habilitation Thesis Mémoire d’Habilitation à Diriger des Recherches submitted by

Source URL: www.lsv.ens-cachan.fr

• Computer science
• Finite-state machine
• Model checking
• Formal verification
• Nested word
• Formal methods
• Automata-based programming
• Automata theory
• Theoretical computer science
• Applied mathematics

ACM ICPC 2014–2015, NEERC, Northern Subregional Contest St Petersburg, November 8, 2014 Problem A. Alarm Clock Input file: Output file:

Source URL: neerc.ifmo.ru

• Formal languages
• Procedural programming languages
• Cross-platform software
• Lambda calculus
• Automata theory
• Regular expression
• Function
• Combinatory logic
• C
• Mathematics
• Software engineering
• Computing