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
.
Filters
Theorem Proving for Verification (Invited Tutorial)
[chapter]
Lecture Notes in Computer Science
We will confine ourselves here to full formal verification techniques that can be used to prove complete correctness of a (model of a) system with respect to a formal specification. ...
Roughly speaking, these methods model the system and specification in a logical formalism and then apply general methods to determine whether the formal expressions are valid, indicating correctness of ...
An example is reported in [31] , which describes the formal verification of division algorithms. ...
doi:10.1007/978-3-540-70545-1_4
fatcat:y7diw3oelzeizomwwgvxjgbar4
Adversarial Robustness of Deep Learning: Theory, Algorithms, and Applications
[article]
2021
arXiv
pre-print
This tutorial will particularly highlight state-of-the-art techniques in adversarial attacks and robustness verification of deep neural networks (DNNs). ...
We will also summarize potential research directions concerning the adversarial robustness of deep learning, and its potential benefits to enable accountable and trustworthy deep learning-based data analytical ...
He is actively engaged with both formal verification and artificial intelligence communities and has given a number of invited talks on topics related to the safety of artificial intelligence. ...
arXiv:2108.10451v1
fatcat:whz2yz2dbbflvmunjej4qknlwi
Preface of the special issue on the Conference on Formal Methods in Computer-Aided Design 2017
2021
Formal methods in system design
We thank the authors for their excellent work, all reviewers for their time and valuable suggestions for improving the manuscripts, and Daniel Kroening, the FMSD Editor in Chief, for his support. ...
In addition to the invited and contributed talks, the conference included a tutorial day, a student forum providing a platform for graduate students to present their research [6] , and a symposium in ...
The FMCAD conference focuses on theoretical results and tools in the field of automated verification and formal methods, and provides a leading forum that brings together researchers in academia and industry ...
doi:10.1007/s10703-020-00357-x
fatcat:3hdruj6kcfba3bgcmdol34sbua
Report of the 2016 Embedded Systems Week (ESWEEK)
2017
IEEE design & test
including modeling, analysis, and formal verification; IoT security and privacy; embedded systems meet life sciences; algorithms and hardware for learning on a chip. ...
, in a mix of technical papers, special sessions, and invited speakers. ...
including modeling, analysis, and formal verification; IoT security and privacy; embedded systems meet life sciences; algorithms and hardware for learning on a chip. ...
doi:10.1109/mdat.2016.2622718
fatcat:lbhc4ai2gfcspchz4i5ongqome
Introduction to the PSTV-IX
1991
Computer networks and ISDN systems
Bochmann and Bj~rn Pehrson, who contributed the reports on the workshop sessions they respectively chaired. ...
Besides the regular sessions and the invited presentations, the Symposium featured one day of tutorial presentations and two short workshop sessions. ...
Three invited presentations introduced the audience to new topics: one on compositional methods in design and verification of real-time distributed systems, by W.P. de Roever and J.J.M. ...
doi:10.1016/0169-7552(91)90078-q
fatcat:abmyrcfipbhprdrlrgvlcjbxwa
Conference Report: COMPASS '96 - The Eleventh Annual Conference on Computer Assurance, Gaithersburg, MD - June 17-21, 1996
1996
Journal of Research of the National Institute of Standards and Technology
Services Division; and Uma Satyen, MITRE Corporation. ...
Acknowledgments The following COMPASS '96 Conference Committee and Board members contributed to this report: Paul Anderson, Space and Naval Warfare Systems Command; Bonnie Danner, TRW Government Information ...
Cheng of the University of Houston gave a half-day tutorial on "Formal Analysis and Verification of Real-Time Systems." Mr. ...
doi:10.6028/jres.101.075
pmid:27805078
pmcid:PMC4900807
fatcat:avx7ulw2tjeo7b3zquvp4ix7la
Front Matter, Table of Contents, Foreword, Conference Organization, External Reviewers
2017
Symposium on Theoretical Aspects of Computer Science
On Long Words Avoiding Zimin Patterns Arnaud Carayol and Stefan Göller . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 19:1-19:13 Extended Learning Graphs ...
in MSO Mikołaj Bojańczyk and Michał Pilipczuk . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 15:1-15:13 Rupert Hölzl, and Rutger Kuyper . . . . . . . . . . . . . . . ...
geometry, cryptography, algorithmic learning theory, algorithmic game theory; automata and formal languages, including: algebraic and categorical methods, coding theory; complexity and computability, ...
doi:10.4230/lipics.stacs.2017.0
dblp:conf/stacs/X17
fatcat:kkk4xuaazzc7dlr3hv7xosrsum
FLAIRS 2000 Conference Report
2001
The AI Magazine
It sponsored nine paper presentations, one panel discussion, and one tutorial on the verification of software through formal theorem-proving methods. ...
genetic algorithms, machine learning, classification, data mining, and AI applications. ...
doi:10.1609/aimag.v22i1.1550
dblp:journals/aim/GonzalezT01
fatcat:u5o4qye2gne6jognv2u76nmaym
Frontmatter, Table of Contents, Preface, Workshop Organization
2013
Symposium on Theoretical Aspects of Computer Science
We would like to express our thanks to the three invited speakers, Kousha Etessami, Kurt Mehlhorn, and Stéphan Thomassé, and to Dániel Marx, the invited tutorial speaker. ...
These proceedings contain extended abstracts of the accepted contributions and abstracts of the invited talks and the tutorial. ...
geometry, cryptography, algorithmic learning theory, analysis of algorithms; automata and formal languages, games; computational complexity, randomness in computation; logic in computer science, including ...
doi:10.4230/lipics.stacs.2013.i
dblp:conf/stacs/PortierW13
fatcat:7vrdra3ocrcidkpcyfoxjgm7em
SAT-solving in practice
2008
2008 9th International Workshop on Discrete Event Systems
In this tutorial paper, we show briefly how such SAT-solvers are implemented, and point to some typical applications of them. ...
It is of practical interest because modern SAT-solvers can be used to solve many important and practical problems. ...
The authors gratefully acknowledge Joao Marques-Silva for useful comments on earlier drafts of this paper, and Bengt Lennartson and Martin Fabian from the Signals and Systems Department at Chalmers for ...
doi:10.1109/wodes.2008.4605923
fatcat:c3w2p5n2ena33aozdweue4eklq
COST Action IC1402 Runtime Verification Beyond Monitoring
[chapter]
2018
Lecture Notes in Computer Science
In this paper we report on COST Action IC1402 which studies Runtime Verification approaches beyond Monitoring. ...
COST Actions are funded by the European Union and are an efficient networking instrument for researchers, engineers and scholars to cooperate and coordinate research activities. ...
For tutorials and overviews of the field of Runtime Verification, we refer to [11, 28, 22, 15] . ...
doi:10.1007/978-3-030-03769-7_2
fatcat:5ephf6bopndidoywqzddmw27nq
Page 203 of Journal of Research and Practice in Information Technology Vol. 18, Issue 4
[page]
1986
Journal of Research and Practice in Information Technology
The authors foresee a trend toward portability of microcode across different architectures, and urge greater use of formal verification techniques to validate designs. ...
Banerji’s paper concentrates on learning, and specifically on that aspect of learning which is the improvement of performance through experience. ...
Front Matter, Table of Contents, Preface, Conference Organization
2018
Symposium on Theoretical Aspects of Computer Science
Demaine, Sarah Eisenstat, and Mikhail Rudoy . . . . . . . . . . . . . . . . . . . . . . . . . . .24:1-24:13 Approximation Algorithms for Scheduling with Resource and Precedence ConstraintsGökalp Demirci ...
.21:1-21:15 Upper and Lower Bounds for Dynamic Data Structures on Strings Raphael Clifford, Allan Grønlund, Kasper Green Larsen, and Tatiana Starikovskaya 22:1-22:14 Lower Bounds for Combinatorial Algorithms ...
; computational geometry, cryptography, algorithmic learning theory, algorithmic game theory; automata and formal languages, including: algebraic and categorical methods, coding theory; complexity and ...
doi:10.4230/lipics.stacs.2018.0
dblp:conf/stacs/X18
fatcat:jgvgsziyhbc6jkcm4wszlwgrsa
KI / MATES 2008
2008
Künstliche Intelligenz
The conference aims to provide a forum for both researchers and practitioners, offering a technical program of carefully reviewed original research and application papers. ...
areas ranging from formal verification to reasoning about knowledge. ...
The KI 2008 technical program comprises three invited talks, technical poster and paper presentations, two tutorials and seven workshops, covering the whole field of AI, including its foundations, its ...
dblp:journals/ki/Dengel08
fatcat:jreqcvllkjfctcchwund6m3d7u
Front Matter, Table of Contents, Preface, Conference Organization
2020
Symposium on Theoretical Aspects of Computer Science
; computational geometry, cryptography, algorithmic learning theory, algorithmic game theory; automata and formal languages, including: algebraic and categorical methods, coding theory; complexity and ...
This year, we are pleased to invite Thomas Schiex (INRAE, Toulouse, France) and Stéphan Thomassé (LIP, ENS Lyon, France) to the tutorial session. ...
doi:10.4230/lipics.stacs.2020.0
dblp:conf/stacs/X20
fatcat:kp4ylsoxcfdlnkjj2zzbfxf2nq
« Previous
Showing results 1 — 15 out of 1,755 results