Titlebook: Mathematics of Program Construction; 11th International C Jeremy Gibbons,Pablo Nogueira Conference proceedings 2012 Springer-Verlag Berlin

IU421

书目名称Mathematics of Program Construction影响因子(影响力)




书目名称Mathematics of Program Construction影响因子(影响力)学科排名




书目名称Mathematics of Program Construction网络公开度




书目名称Mathematics of Program Construction网络公开度学科排名




书目名称Mathematics of Program Construction被引频次




书目名称Mathematics of Program Construction被引频次学科排名




书目名称Mathematics of Program Construction年度引用




书目名称Mathematics of Program Construction年度引用学科排名




书目名称Mathematics of Program Construction读者反馈




书目名称Mathematics of Program Construction读者反馈学科排名

Interregnum

The Geometry of Synthesisges. Such languages are generally recognised as more accessible than hardware description languages, and it is expected that their use would significantly increase design productivity. The Geometry of Synthesis is a new hardware compilation technique which achieves this goal in a semantic-directed f

IDEAS

Scheduler-Independent Declassificationing languages. In this article, we aim at guaranteeing the security of concurrent programs. We propose the novel security property WHAT&WHERE that allows one to limit what information may be declassified where in a program. We show that our property provides adequate security guarantees independent

Debrief

送秋波

Scheduling and Buffer Sizing of n-Synchronous Systemsmputes static schedules of the processes and the sizes of the buffers between them..In this article, we present a new algorithm which solves the subtyping constraints generated by the clock calculus. The advantage of this algorithm is that it finds schedules for tightly coupled systems. Moreover, it

keloid

Deriving Real-Time Action Systems Controllers from Multiscale System Specificationsies. To this end, we incorporate the theory of time bands into action systems, which allows one to structure a system into multiple abstractions of time. The framework includes a logic that facilitates reasoning about different types of sampling errors and transient properties (i.e., properties that

卜闻

Calculating Graph Algorithms for Dominance and Shortest Patht path problem. Both algorithms are calculated directly from the definition of the properties by . of (1) a least fixed point expressing all finite paths through a directed graph and (2) Galois connections that capture dominance and path length..The approach illustrates that reasoning in the style o

冷峻

作呕

filial

Unifying Correctness Statementsions. Algebras structure this diversity of models to avoid the repeated development of similar theories and to clarify their range of application. We introduce algebras that uniformly describe correctness statements, correctness calculi, pre-post specifications and loop refinement rules in five kind