Zobrazeno 1 - 10
of 28
pro vyhledávání: '"B.1.4"'
Autor:
Geeson, Luke, Smith, Lee
Finding bugs is key to the correctness of compilers in wide use today. If the behaviour of a compiled program, as allowed by its architecture memory model, is not a behaviour of the source program under its source model, then there is a bug. This hol
Externí odkaz:
http://arxiv.org/abs/2310.12337
The integration of distributed energy resources (DERs) into the electrical grid causes various challenges in the distribution grids. The complexity of smart grids as multi-domain energy systems requires innovative architectures and algorithms for sys
Externí odkaz:
http://arxiv.org/abs/2309.09792
Discrete Event Modelling of Embedded Systems (DEMES) is a development methodology based on the Discrete Event Systems (DEVS) specification that improves the time -to-market by simplifying the development and testing of embedded systems. CADMIUM is a
Externí odkaz:
http://arxiv.org/abs/2304.07961
This work presents a smartwatch attached to patients at remote locations, which would help in the navigation of wheel chair and monitor the vitals of patients and relay it through IoT. This wearable smartwatch is equipped with sensors to measure heal
Externí odkaz:
http://arxiv.org/abs/2304.07789
Autor:
de Nivelle, Hans, Muktubayeva, Dina
Publikováno v:
EPTCS 370, 2022, pp. 66-80
We introduce flat automata for automatic generation of tokenizers. Flat automata are a simple representation of standard finite automata. Using the flat representation, automata can be easily constructed, combined and printed. Due to the use of borde
Externí odkaz:
http://arxiv.org/abs/2209.10313
Autor:
Banks, Christopher J., Elver, Marco, Hoffmann, Ruth, Sarkar, Susmit, Jackson, Paul, Nagarajan, Vijay
In this paper we verify a modern lazy cache coherence protocol, TSO-CC, against the memory consistency model it was designed for, TSO. We achieve this by first showing a weak simulation relation between TSO-CC (with a fixed number of processors) and
Externí odkaz:
http://arxiv.org/abs/1705.08262
Autor:
Mieścicki, Jerzy, Daszczuk, Wiktor B.
Publikováno v:
Annales UMCS, Informatica AI v. 4 (2006), pp. 254-265
The case study analyzed in the paper illustrates the example of model checking in the COSMA environment. The system itself is a three-stage pipeline consisting of mutually concurrent modules which also compete for a shared resource. System components
Externí odkaz:
http://arxiv.org/abs/1703.05523
Autor:
Kundra, Divya, Sureka, Ashish
Compiler design is a course that discusses ideas used in construction of programming language compilers. Students learn how a program written in high level programming language and designed for humans understanding is systematically converted into lo
Externí odkaz:
http://arxiv.org/abs/1611.00271
In this paper we discuss how semantic annotations can be used to introduce mathematical algorithmic information of the underlying imperative code to enable compilers to produce code transformations that will enable better performance. By using this a
Externí odkaz:
http://arxiv.org/abs/1603.01520
Autor:
Wisniewski, Rafael
Publikováno v:
EPTCS 124, 2013, pp. 5-8
Formal verification has been successfully developed in computer science for verifying combinatorial classes of models and specifications. In like manner, formal verification methods have been developed for dynamical systems. However, the verification
Externí odkaz:
http://arxiv.org/abs/1308.5330