37th IFIP WG 6.1 International Conference on Formal Techniques for Distributed Objects, Components, and Systems
FORTE 2017 is a forum for fundamental research on theory, models, tools, and applications for distributed systems. The conference solicits original contributions that advance the science and technologies for distributed systems, with special interest in the areas of:
Contributions that combine theory and practice and that exploit formal methods and theoretical foundations to present novel solutions to problems arising from the development of distributed systems are encouraged. FORTE covers distributed computing models and formal specification, testing and verification methods. The application domains include all kinds of application-level distributed systems, telecommunication services, Internet, embedded and real-time systems, as well as networking and communication security and reliability.
FORTE 2017 has the pleasure to have a keynote presentation by Dr Rupak Majumdar (MPI, Germany).
Rupak Majumdar is a Scientific Director at the Max Planck Institute for Software Systems. His research interests are in the verification and control of cyber-physical systems, software verification and program analysis, logic, and automata theory.
Dr. Majumdar received the President's Gold Medal from IIT, Kanpur, the Leon O. Chua award from UC Berkeley, an NSF CAREER award, a Sloan Foundation Fellowship, an ERC Synergy award, "Most Influential Paper" awards from PLDI and POPL, and several best paper awards.
He received the B.Tech. degree in Computer Science from the Indian Institute of Technology at Kanpur and the Ph.D. degree in Computer Science from the University of California at Berkeley.
Systematic Testing for Asynchronous Programs
Asynchronous programming is a generic term for concurrent programming with co-operative task management and shows up in many different applications.
For example, many programming models for the web, smartphone and cloud-backed applications, server applications, and embedded systems implement programming in this style. In all these scenarios, while programs can be very efficient, the manual management of resources and asynchronous procedures can make programming quite difficult.
The natural control flow of a task is obscured and the programmer must ensure correct behavior for all possible orderings of external events.
Specifically, the global state of the program can change between the time an asynchronous procedure is posted and the time the scheduler picks and runs it.
In this talk, I will describe algorithmic analysis techniques for systematic testing of asynchronous programs. I will talk about formal models for asynchronous programs and verification and systematic testing techniques for these models.
The results will use connections between asynchronous programs and classical concurrency models such as Petri nets, partial order reductions for asynchronous programs, as well as combinatorial constructions of small test suites with formal guarantees of coverage.
Topics of interest include but are not limited to:
Contributions must be written in English and report on original, unpublished work, not submitted for publication elsewhere (cf. IFIP’s codes of conduct). The submissions must be prepared using Springer’s LNCS style. Submissions not adhering to the specified constraints may be rejected without review. Papers must be submitted electronically in pdf via the FORTE’17 interface of the EasyChair system (https://easychair.org/conferences/?conf=forte2017).
We solicit four kinds of submissions:
Each paper will undergo a peer review of at least 3 anonymous reviewers. The conference proceedings will be published by Springer in the LNCS Series. The best papers will be invited after the conference to contribute to a special issue of a top-level journal.