10 research outputs found
Layered Fixed Point Logic
We present a logic for the specification of static analysis problems that
goes beyond the logics traditionally used. Its most prominent feature is the
direct support for both inductive computations of behaviors as well as
co-inductive specifications of properties. Two main theoretical contributions
are a Moore Family result and a parametrized worst case time complexity result.
We show that the logic and the associated solver can be used for rapid
prototyping and illustrate a wide variety of applications within Static
Analysis, Constraint Satisfaction Problems and Model Checking. In all cases the
complexity result specializes to the worst case time complexity of the
classical methods
Formal modelling and analysis of broadcasting embedded control systems
PhD ThesisEmbedded systems are real-time, communicating systems, and the effective
modelling and analysis of these aspects of their behaviour is regarded as essential
for acquiring confidence in their correct operation. In practice, it is important
to minimise the burden of model construction and to automate the analysis,
if possible. Among the most promising techniques for real-time systems are
reachability analysis and model-checking of networks of timed automata. We
identify two obstacles to the application of these techniques to a large class of
distributed embedded systems: firstly, the language of timed automata is too
low-level for straightforward model construction, and secondly, the synchronous,
handshake communication mechanism of the timed automata model does not fit
well with the asynchronous, broadcast mechanism employed in many distributed
embedded systems. As a result, the task of model construction can be unduly
onerous.
This dissertation proposes an expressive language for the construction of
models of real-time, broadcasting control systems, and demonstrates how effi-
cient analysis techniques can be applied to them.
The dissertation is concerned in particular with the Controller Area Network
(CAN) protocol which is emerging as a de facto standard in the automotive
industry. An abstract formal model of CAN is developed. This model is adopted
as the communication primitive in a new language, bCANDLE, which includes
value passing, broadcast communication, message priorities and explicit time.
A high-level language, CANDLE, is introduced and its semantics defined by
translation to bCANDLE. We show how realistic CAN systems can be described
in CANDLE and how a timed transition model of a system can be extracted for
analysis. Finally, it is shown how efficient methods of analysis, such as 'on-the-
fly' and symbolic techniques, can be applied to these models. The dissertation
contributes to the practical application of formal methods within the domain
of broadcasting, embedded control systemsSchool of Computing and Mathematics at the University of Northumbri
Actes des Cinquièmes journées nationales du Groupement De Recherche CNRS du Génie de la Programmation et du Logiciel
National audienceCe document contient les actes des Cinquièmes journées nationales du Groupement De Recherche CNRS du Gé}nie de la Programmation et du Logiciel (GDR GPL) s'étant déroulées à Nancy du 3 au 5 avril 2013. Les contributions présentées dans ce document ont été sélectionnées par les différents groupes de travail du GDR. Il s'agit de résumés, de nouvelles versions, de posters et de démonstrations qui correspondent à des travaux qui ont déjà été validés par les comités de programmes d'autres conférences et revues et dont les droits appartiennent exclusivement à leurs auteurs
Programming Languages and Systems
This open access book constitutes the proceedings of the 28th European Symposium on Programming, ESOP 2019, which took place in Prague, Czech Republic, in April 2019, held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2019
Explicit Versus Symbolic Algorithms for Solving ALFP Constraints
AbstractALFP, Alternation-free Least Fixed Point logic, has successfully been used as an intermediate language in the implementation of static analysis and model checking problems. Clearly different analysis problems may give rise to ALFP clauses with different characteristics. There are also different approaches to solving ALFP clauses and some of those are better suited for certain kinds of clauses than others. The aim of this paper is to present two algorithms, one that is based on differential worklists and one based on BDD's, and experiment with them
Fuelling the zero-emissions road freight of the future: routing of mobile fuellers
The future of zero-emissions road freight is closely tied to the sufficient availability of new and clean fuel options such as electricity and Hydrogen. In goods distribution using Electric Commercial Vehicles (ECVs) and Hydrogen Fuel Cell Vehicles (HFCVs) a major challenge in the transition period would pertain to their limited autonomy and scarce and unevenly distributed refuelling stations. One viable solution to facilitate and speed up the adoption of ECVs/HFCVs by logistics, however, is to get the fuel to the point where it is needed (instead of diverting the route of delivery vehicles to refuelling stations) using "Mobile Fuellers (MFs)". These are mobile battery swapping/recharging vans or mobile Hydrogen fuellers that can travel to a running ECV/HFCV to provide the fuel they require to complete their delivery routes at a rendezvous time and space. In this presentation, new vehicle routing models will be presented for a third party company that provides MF services. In the proposed problem variant, the MF provider company receives routing plans of multiple customer companies and has to design routes for a fleet of capacitated MFs that have to synchronise their routes with the running vehicles to deliver the required amount of fuel on-the-fly. This presentation will discuss and compare several mathematical models based on different business models and collaborative logistics scenarios