AbstractThis paper shows how a formal notion of refinement may be defined for models, and model components, expressed in the Unified Modeling Language (UML). A formal, behavioural semantics is given to combinations of class, object, and state diagrams, using the notation of Communicating Sequential Processes (CSP); this semantics is adequate for the analysis of concurrent, communicating behaviour, and induces a notion of refinement for UML based upon existing notions of traces and failures refinement for CSP
AbstractIn this contribution we propose an agent architecture for theorem proving which we intend to...
AbstractWe use ω–finite automata as a device for compressing bi-level images. One of the advantages ...
AbstractWe present an imperative calculus for a class-based language. By introducing classes as the ...
AbstractThe aim of this paper is to propose a unified analysis of the relationships between the noti...
The classical problem of homogenization of elliptic operators with periodically oscillating coeffici...
Microarray analyses of gene expression are widely used, but reports of the same analyses by differen...
AbstractSOL (Secure Operations Language) is a synchronous programming language for implementing reac...
AbstractSystem S is a calculus providing the basic abstractions of term rewriting: matching and buil...
AbstractComponent-oriented software development is becoming more and more important for the producti...
AbstractIn the paper, we propose an automated, SVG-based visualization framework for modeling langua...
BackgroundThe outcome of severe acute pancreatitis has scarcely improved in 10 years. Further impact...
AbstractA problem that often has to be solved by compilers for functional languages targeting the Ja...
AbstractThis paper proposes an intermediate approach between simulation and formal verification. Thi...
The information system for planning and control of project realization in construction industry is p...
AbstractAcceptable logic programs have been studied extensively in the context of proving terminatio...
AbstractIn this contribution we propose an agent architecture for theorem proving which we intend to...
AbstractWe use ω–finite automata as a device for compressing bi-level images. One of the advantages ...
AbstractWe present an imperative calculus for a class-based language. By introducing classes as the ...
AbstractThe aim of this paper is to propose a unified analysis of the relationships between the noti...
The classical problem of homogenization of elliptic operators with periodically oscillating coeffici...
Microarray analyses of gene expression are widely used, but reports of the same analyses by differen...
AbstractSOL (Secure Operations Language) is a synchronous programming language for implementing reac...
AbstractSystem S is a calculus providing the basic abstractions of term rewriting: matching and buil...
AbstractComponent-oriented software development is becoming more and more important for the producti...
AbstractIn the paper, we propose an automated, SVG-based visualization framework for modeling langua...
BackgroundThe outcome of severe acute pancreatitis has scarcely improved in 10 years. Further impact...
AbstractA problem that often has to be solved by compilers for functional languages targeting the Ja...
AbstractThis paper proposes an intermediate approach between simulation and formal verification. Thi...
The information system for planning and control of project realization in construction industry is p...
AbstractAcceptable logic programs have been studied extensively in the context of proving terminatio...
AbstractIn this contribution we propose an agent architecture for theorem proving which we intend to...
AbstractWe use ω–finite automata as a device for compressing bi-level images. One of the advantages ...
AbstractWe present an imperative calculus for a class-based language. By introducing classes as the ...