OnlineWoerterBuecher.de
Internes

Lexikon


formal methods


Mathematically based techniques for the specification, development and verification of software and hardware systems. Referentially transparent languages are amenable to symbolic manipulation allowing program transformation (e.g. changing a clear inefficient specification into an obscure but efficient program) and proof of correctness. {Oxford FM archive (http://www.comlab.ox.ac.uk/archive/formal-methods.html)}. (1996-05-15)

In addition suitable contents:
[ = ] [ ag ] [ al ] [ am ] [ an ] [ ar ] [ arc ] [ archive ] [ as ] [ at ] [ b ] [ ba ] [ base ] [ bo ] [ bs ] [ ca ] [ cat ] [ ch ] [ ci ] [ cl ] [ co ] [ com ] [ cu ] [ de ] [ development ] [ du ] [ ec ] [ ed ] [ er ] [ es ] [ et ] [ fi ] [ file ] [ FM ] [ fo ] [ for ] [ ge ] [ gi ] [ gr ] [ gu ] [ h ] [ hang ] [ hardware ] [ hn ] [ hr ] [ ht ] [ id ] [ ie ] [ il ] [ in ] [ int ] [ io ] [ iq ] [ la ] [ language ] [ Lex ] [ li ] [ ly ] [ M ] [ ma ] [ man ] [ Mathematica ] [ method ] [ ml ] [ mo ] [ mod ] [ module ] [ ms ] [ na ] [ ne ] [ ng ] [ ni ] [ ns ] [ O ] [ om ] [ op ] [ Ox ] [ pa ] [ parent ] [ pe ] [ ph ] [ pm ] [ pr ] [ program ] [ program transformation ] [ proof ] [ query ] [ ques ] [ rc ] [ re ] [ ro ] [ sc ] [ se ] [ so ] [ software ] [ spec ] [ specification ] [ st ] [ sy ] [ system ] [ th ] [ tm ] [ tn ] [ to ] [ tp ] [ tr ] [ transformation ] [ transparent ] [ tt ] [ tw ] [ ua ] [ uk ] [ ve ] [ verification ] [ win ]






Go Back ]

Free On-line Dictionary of Computing

Copyright © by OnlineWoerterBuecher.de - (3782 Reads)

All logos and trademarks in this site are property of their respective owner.

Page Generation in 0.0849 Seconds, with 17 Database-Queries
Zurück zur Startseite